YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 08:51:55,321 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 08:51:55,323 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 08:51:55,334 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 08:51:55,334 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 08:51:55,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 08:51:55,336 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 08:51:55,338 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 08:51:55,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 08:51:55,340 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 08:51:55,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 08:51:55,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 08:51:55,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 08:51:55,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 08:51:55,344 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 08:51:55,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 08:51:55,345 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 08:51:55,347 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 08:51:55,349 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 08:51:55,350 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 08:51:55,351 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 08:51:55,352 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 08:51:55,354 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 08:51:55,355 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 08:51:55,355 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 08:51:55,355 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 08:51:55,356 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 08:51:55,357 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 08:51:55,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 08:51:55,357 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 08:51:55,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 08:51:55,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 08:51:55,360 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 08:51:55,360 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 08:51:55,360 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 08:51:55,361 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 08:51:55,361 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 08:51:55,362 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 08:51:55,362 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 08:51:55,363 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 08:51:55,377 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 08:51:55,377 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 08:51:55,378 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 08:51:55,378 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 08:51:55,378 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 08:51:55,379 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:51:55,379 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 08:51:55,379 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 08:51:55,379 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 08:51:55,379 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 08:51:55,379 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 08:51:55,380 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 08:51:55,380 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 08:51:55,380 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 08:51:55,380 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:51:55,380 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 08:51:55,380 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 08:51:55,381 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 08:51:55,381 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 08:51:55,381 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 08:51:55,381 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 08:51:55,382 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 08:51:55,382 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 08:51:55,382 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 08:51:55,382 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:51:55,382 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 08:51:55,383 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 08:51:55,383 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 08:51:55,383 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 08:51:55,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 08:51:55,420 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 08:51:55,424 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 08:51:55,425 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 08:51:55,426 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 08:51:55,426 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:51:55,490 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/3d36e17fc3764014a5365706ecbcd2e1/FLAG0ebc8555e [2020-06-22 08:51:55,840 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 08:51:55,841 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:51:55,841 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 08:51:55,849 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/3d36e17fc3764014a5365706ecbcd2e1/FLAG0ebc8555e [2020-06-22 08:51:56,236 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/3d36e17fc3764014a5365706ecbcd2e1 [2020-06-22 08:51:56,248 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 08:51:56,250 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 08:51:56,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 08:51:56,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 08:51:56,255 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 08:51:56,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368bf4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56, skipping insertion in model container [2020-06-22 08:51:56,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 08:51:56,285 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 08:51:56,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:51:56,528 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 08:51:56,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:51:56,564 INFO L195 MainTranslator]: Completed translation [2020-06-22 08:51:56,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56 WrapperNode [2020-06-22 08:51:56,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 08:51:56,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 08:51:56,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 08:51:56,566 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 08:51:56,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 08:51:56,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 08:51:56,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 08:51:56,607 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 08:51:56,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 08:51:56,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 08:51:56,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 08:51:56,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 08:51:56,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:51:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 08:51:56,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 08:51:56,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 08:51:56,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 08:51:56,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 08:51:56,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 08:51:56,966 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 08:51:56,967 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 08:51:56,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:51:56 BoogieIcfgContainer [2020-06-22 08:51:56,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 08:51:56,969 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 08:51:56,969 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 08:51:56,971 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 08:51:56,972 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:51:56" (1/1) ... [2020-06-22 08:51:56,990 INFO L313 BlockEncoder]: Initial Icfg 38 locations, 44 edges [2020-06-22 08:51:56,992 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 08:51:56,992 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 08:51:56,993 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 08:51:56,993 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:51:56,995 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 08:51:56,996 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 08:51:56,996 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 08:51:57,024 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 08:51:57,057 INFO L200 BlockEncoder]: SBE split 19 edges [2020-06-22 08:51:57,061 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 08:51:57,063 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:51:57,084 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-06-22 08:51:57,087 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-06-22 08:51:57,088 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:51:57,089 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:51:57,089 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 08:51:57,089 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:51:57,090 INFO L313 BlockEncoder]: Encoded RCFG 31 locations, 57 edges [2020-06-22 08:51:57,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:51:57 BasicIcfg [2020-06-22 08:51:57,091 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 08:51:57,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 08:51:57,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 08:51:57,095 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 08:51:57,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 08:51:56" (1/4) ... [2020-06-22 08:51:57,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8960bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:51:57, skipping insertion in model container [2020-06-22 08:51:57,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (2/4) ... [2020-06-22 08:51:57,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8960bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:51:57, skipping insertion in model container [2020-06-22 08:51:57,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:51:56" (3/4) ... [2020-06-22 08:51:57,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8960bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:51:57, skipping insertion in model container [2020-06-22 08:51:57,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:51:57" (4/4) ... [2020-06-22 08:51:57,099 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:51:57,110 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 08:51:57,118 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-06-22 08:51:57,135 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-06-22 08:51:57,164 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:51:57,164 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 08:51:57,165 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 08:51:57,165 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:51:57,165 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:51:57,165 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:51:57,165 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 08:51:57,165 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:51:57,165 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 08:51:57,180 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-06-22 08:51:57,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:51:57,186 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:57,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:51:57,187 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:57,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:57,193 INFO L82 PathProgramCache]: Analyzing trace with hash 200279767, now seen corresponding path program 1 times [2020-06-22 08:51:57,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:57,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:57,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:57,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:57,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:57,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:51:57,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:51:57,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:51:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:57,396 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2020-06-22 08:51:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:57,526 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2020-06-22 08:51:57,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:51:57,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 08:51:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:57,541 INFO L225 Difference]: With dead ends: 31 [2020-06-22 08:51:57,541 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 08:51:57,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:57,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 08:51:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 08:51:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 08:51:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 55 transitions. [2020-06-22 08:51:57,584 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 55 transitions. Word has length 5 [2020-06-22 08:51:57,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:57,586 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 55 transitions. [2020-06-22 08:51:57,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:51:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 55 transitions. [2020-06-22 08:51:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:51:57,586 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:57,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:51:57,587 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:57,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:57,587 INFO L82 PathProgramCache]: Analyzing trace with hash 200279769, now seen corresponding path program 1 times [2020-06-22 08:51:57,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:57,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:57,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:57,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:57,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:57,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:51:57,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:51:57,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:51:57,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:51:57,640 INFO L87 Difference]: Start difference. First operand 30 states and 55 transitions. Second operand 4 states. [2020-06-22 08:51:57,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:57,717 INFO L93 Difference]: Finished difference Result 31 states and 55 transitions. [2020-06-22 08:51:57,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:51:57,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 08:51:57,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:57,718 INFO L225 Difference]: With dead ends: 31 [2020-06-22 08:51:57,718 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 08:51:57,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:51:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 08:51:57,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-06-22 08:51:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 08:51:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 54 transitions. [2020-06-22 08:51:57,725 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 54 transitions. Word has length 5 [2020-06-22 08:51:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:57,725 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 54 transitions. [2020-06-22 08:51:57,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:51:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 54 transitions. [2020-06-22 08:51:57,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 08:51:57,727 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:57,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 08:51:57,727 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:57,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:57,728 INFO L82 PathProgramCache]: Analyzing trace with hash 200279770, now seen corresponding path program 1 times [2020-06-22 08:51:57,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:57,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:57,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:57,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:51:57,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:51:57,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:51:57,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:57,771 INFO L87 Difference]: Start difference. First operand 30 states and 54 transitions. Second operand 3 states. [2020-06-22 08:51:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:57,873 INFO L93 Difference]: Finished difference Result 30 states and 54 transitions. [2020-06-22 08:51:57,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:51:57,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 08:51:57,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:57,875 INFO L225 Difference]: With dead ends: 30 [2020-06-22 08:51:57,875 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 08:51:57,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:57,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 08:51:57,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 08:51:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 08:51:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 53 transitions. [2020-06-22 08:51:57,880 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 53 transitions. Word has length 5 [2020-06-22 08:51:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:57,880 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 53 transitions. [2020-06-22 08:51:57,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:51:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 53 transitions. [2020-06-22 08:51:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 08:51:57,881 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:57,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:51:57,881 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:57,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:57,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1913704544, now seen corresponding path program 1 times [2020-06-22 08:51:57,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:57,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:57,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:57,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:57,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:57,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:51:57,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:51:57,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:51:57,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:57,912 INFO L87 Difference]: Start difference. First operand 29 states and 53 transitions. Second operand 3 states. [2020-06-22 08:51:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:57,973 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2020-06-22 08:51:57,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:51:57,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 08:51:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:57,975 INFO L225 Difference]: With dead ends: 29 [2020-06-22 08:51:57,975 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 08:51:57,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 08:51:57,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 08:51:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 08:51:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. [2020-06-22 08:51:57,979 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 6 [2020-06-22 08:51:57,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:57,980 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 51 transitions. [2020-06-22 08:51:57,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:51:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. [2020-06-22 08:51:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 08:51:57,980 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:57,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:51:57,981 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:57,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:57,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1913704546, now seen corresponding path program 1 times [2020-06-22 08:51:57,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:57,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:57,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:57,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:51:58,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:51:58,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:51:58,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:58,026 INFO L87 Difference]: Start difference. First operand 28 states and 51 transitions. Second operand 3 states. [2020-06-22 08:51:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:58,103 INFO L93 Difference]: Finished difference Result 29 states and 51 transitions. [2020-06-22 08:51:58,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:51:58,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-06-22 08:51:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:58,104 INFO L225 Difference]: With dead ends: 29 [2020-06-22 08:51:58,104 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 08:51:58,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 08:51:58,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 08:51:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 08:51:58,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 50 transitions. [2020-06-22 08:51:58,109 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 50 transitions. Word has length 6 [2020-06-22 08:51:58,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,109 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 50 transitions. [2020-06-22 08:51:58,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:51:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. [2020-06-22 08:51:58,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-06-22 08:51:58,110 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,110 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1913704547, now seen corresponding path program 1 times [2020-06-22 08:51:58,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:51:58,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:51:58,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:51:58,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:51:58,149 INFO L87 Difference]: Start difference. First operand 28 states and 50 transitions. Second operand 4 states. [2020-06-22 08:51:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:58,227 INFO L93 Difference]: Finished difference Result 28 states and 50 transitions. [2020-06-22 08:51:58,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:51:58,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-06-22 08:51:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:58,229 INFO L225 Difference]: With dead ends: 28 [2020-06-22 08:51:58,229 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 08:51:58,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:51:58,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 08:51:58,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 08:51:58,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 08:51:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions. [2020-06-22 08:51:58,233 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 49 transitions. Word has length 6 [2020-06-22 08:51:58,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,234 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 49 transitions. [2020-06-22 08:51:58,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:51:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 49 transitions. [2020-06-22 08:51:58,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 08:51:58,234 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,235 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,235 INFO L82 PathProgramCache]: Analyzing trace with hash -804700043, now seen corresponding path program 1 times [2020-06-22 08:51:58,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:51:58,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:51:58,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:51:58,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:51:58,278 INFO L87 Difference]: Start difference. First operand 27 states and 49 transitions. Second operand 4 states. [2020-06-22 08:51:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:58,368 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2020-06-22 08:51:58,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:51:58,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 08:51:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:58,369 INFO L225 Difference]: With dead ends: 27 [2020-06-22 08:51:58,369 INFO L226 Difference]: Without dead ends: 25 [2020-06-22 08:51:58,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:51:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-06-22 08:51:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-06-22 08:51:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 08:51:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 45 transitions. [2020-06-22 08:51:58,374 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 45 transitions. Word has length 7 [2020-06-22 08:51:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,374 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 45 transitions. [2020-06-22 08:51:58,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:51:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 45 transitions. [2020-06-22 08:51:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 08:51:58,375 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,375 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,375 INFO L82 PathProgramCache]: Analyzing trace with hash -804700041, now seen corresponding path program 1 times [2020-06-22 08:51:58,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:51:58,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:51:58,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:51:58,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:51:58,414 INFO L87 Difference]: Start difference. First operand 25 states and 45 transitions. Second operand 4 states. [2020-06-22 08:51:58,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:58,512 INFO L93 Difference]: Finished difference Result 46 states and 79 transitions. [2020-06-22 08:51:58,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:51:58,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 08:51:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:58,513 INFO L225 Difference]: With dead ends: 46 [2020-06-22 08:51:58,513 INFO L226 Difference]: Without dead ends: 44 [2020-06-22 08:51:58,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:51:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-06-22 08:51:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2020-06-22 08:51:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 08:51:58,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 73 transitions. [2020-06-22 08:51:58,520 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 73 transitions. Word has length 7 [2020-06-22 08:51:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,520 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 73 transitions. [2020-06-22 08:51:58,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:51:58,521 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 73 transitions. [2020-06-22 08:51:58,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 08:51:58,521 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,522 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,522 INFO L82 PathProgramCache]: Analyzing trace with hash -804700040, now seen corresponding path program 1 times [2020-06-22 08:51:58,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 08:51:58,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 08:51:58,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 08:51:58,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:51:58,588 INFO L87 Difference]: Start difference. First operand 35 states and 73 transitions. Second operand 6 states. [2020-06-22 08:51:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:58,718 INFO L93 Difference]: Finished difference Result 44 states and 77 transitions. [2020-06-22 08:51:58,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:51:58,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-06-22 08:51:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:58,719 INFO L225 Difference]: With dead ends: 44 [2020-06-22 08:51:58,719 INFO L226 Difference]: Without dead ends: 42 [2020-06-22 08:51:58,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:51:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-06-22 08:51:58,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-06-22 08:51:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-06-22 08:51:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 71 transitions. [2020-06-22 08:51:58,725 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 71 transitions. Word has length 7 [2020-06-22 08:51:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,725 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 71 transitions. [2020-06-22 08:51:58,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 08:51:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 71 transitions. [2020-06-22 08:51:58,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 08:51:58,726 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,726 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1686893786, now seen corresponding path program 1 times [2020-06-22 08:51:58,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:51:58,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:51:58,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:51:58,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:58,751 INFO L87 Difference]: Start difference. First operand 35 states and 71 transitions. Second operand 3 states. [2020-06-22 08:51:58,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:58,811 INFO L93 Difference]: Finished difference Result 68 states and 139 transitions. [2020-06-22 08:51:58,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:51:58,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-06-22 08:51:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:58,812 INFO L225 Difference]: With dead ends: 68 [2020-06-22 08:51:58,812 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 08:51:58,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 08:51:58,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2020-06-22 08:51:58,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-06-22 08:51:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 73 transitions. [2020-06-22 08:51:58,818 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 73 transitions. Word has length 10 [2020-06-22 08:51:58,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,818 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 73 transitions. [2020-06-22 08:51:58,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:51:58,818 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 73 transitions. [2020-06-22 08:51:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 08:51:58,819 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,819 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1686894747, now seen corresponding path program 1 times [2020-06-22 08:51:58,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:51:58,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:51:58,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:51:58,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:58,854 INFO L87 Difference]: Start difference. First operand 37 states and 73 transitions. Second operand 3 states. [2020-06-22 08:51:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:58,917 INFO L93 Difference]: Finished difference Result 37 states and 73 transitions. [2020-06-22 08:51:58,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:51:58,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-06-22 08:51:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:58,918 INFO L225 Difference]: With dead ends: 37 [2020-06-22 08:51:58,918 INFO L226 Difference]: Without dead ends: 34 [2020-06-22 08:51:58,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:51:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-06-22 08:51:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-06-22 08:51:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 08:51:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. [2020-06-22 08:51:58,923 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 63 transitions. Word has length 10 [2020-06-22 08:51:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:58,923 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 63 transitions. [2020-06-22 08:51:58,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:51:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 63 transitions. [2020-06-22 08:51:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-06-22 08:51:58,923 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:58,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:58,924 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:58,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1686894749, now seen corresponding path program 1 times [2020-06-22 08:51:58,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:58,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:58,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:58,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:58,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:58,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 08:51:58,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 08:51:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 08:51:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:51:58,983 INFO L87 Difference]: Start difference. First operand 34 states and 63 transitions. Second operand 5 states. [2020-06-22 08:51:59,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:59,068 INFO L93 Difference]: Finished difference Result 51 states and 90 transitions. [2020-06-22 08:51:59,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:51:59,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-06-22 08:51:59,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:59,069 INFO L225 Difference]: With dead ends: 51 [2020-06-22 08:51:59,069 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 08:51:59,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:51:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 08:51:59,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2020-06-22 08:51:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 08:51:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2020-06-22 08:51:59,076 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 10 [2020-06-22 08:51:59,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:59,076 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2020-06-22 08:51:59,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 08:51:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2020-06-22 08:51:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 08:51:59,077 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:59,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:59,077 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:59,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1690348888, now seen corresponding path program 1 times [2020-06-22 08:51:59,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:59,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:59,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:59,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:59,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:59,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:51:59,124 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:51:59,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:59,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 08:51:59,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:51:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:59,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 08:51:59,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 08:51:59,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 08:51:59,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 08:51:59,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:51:59,235 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 6 states. [2020-06-22 08:51:59,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:59,343 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2020-06-22 08:51:59,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:51:59,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-06-22 08:51:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:59,344 INFO L225 Difference]: With dead ends: 50 [2020-06-22 08:51:59,345 INFO L226 Difference]: Without dead ends: 48 [2020-06-22 08:51:59,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:51:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-06-22 08:51:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2020-06-22 08:51:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 08:51:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. [2020-06-22 08:51:59,350 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 71 transitions. Word has length 17 [2020-06-22 08:51:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:59,350 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 71 transitions. [2020-06-22 08:51:59,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 08:51:59,350 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 71 transitions. [2020-06-22 08:51:59,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 08:51:59,351 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:59,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:59,351 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:59,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:59,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1690348887, now seen corresponding path program 1 times [2020-06-22 08:51:59,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:59,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:59,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:59,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:59,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:51:59,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:51:59,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:51:59,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-06-22 08:51:59,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-06-22 08:51:59,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-06-22 08:51:59,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-06-22 08:51:59,562 INFO L87 Difference]: Start difference. First operand 42 states and 71 transitions. Second operand 12 states. [2020-06-22 08:51:59,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:51:59,837 INFO L93 Difference]: Finished difference Result 86 states and 145 transitions. [2020-06-22 08:51:59,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 08:51:59,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-06-22 08:51:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:51:59,876 INFO L225 Difference]: With dead ends: 86 [2020-06-22 08:51:59,877 INFO L226 Difference]: Without dead ends: 46 [2020-06-22 08:51:59,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-06-22 08:51:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-06-22 08:51:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2020-06-22 08:51:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 08:51:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 70 transitions. [2020-06-22 08:51:59,881 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 70 transitions. Word has length 17 [2020-06-22 08:51:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:51:59,881 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 70 transitions. [2020-06-22 08:51:59,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-06-22 08:51:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 70 transitions. [2020-06-22 08:51:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 08:51:59,882 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:51:59,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:51:59,883 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:51:59,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:51:59,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1583550055, now seen corresponding path program 1 times [2020-06-22 08:51:59,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:51:59,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:51:59,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:59,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:51:59,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:51:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:00,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:52:00,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:52:00,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:00,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 19 conjunts are in the unsatisfiable core [2020-06-22 08:52:00,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:00,260 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-06-22 08:52:00,261 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:00,264 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:00,264 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:52:00,264 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-06-22 08:52:00,287 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-06-22 08:52:00,288 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:00,289 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:00,289 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:52:00,290 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-06-22 08:52:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:00,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 08:52:00,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2020-06-22 08:52:00,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-06-22 08:52:00,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-06-22 08:52:00,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-06-22 08:52:00,337 INFO L87 Difference]: Start difference. First operand 42 states and 70 transitions. Second operand 16 states. [2020-06-22 08:52:01,334 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2020-06-22 08:52:02,372 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2020-06-22 08:52:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:03,012 INFO L93 Difference]: Finished difference Result 147 states and 232 transitions. [2020-06-22 08:52:03,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-06-22 08:52:03,012 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2020-06-22 08:52:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:52:03,013 INFO L225 Difference]: With dead ends: 147 [2020-06-22 08:52:03,013 INFO L226 Difference]: Without dead ends: 116 [2020-06-22 08:52:03,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=539, Invalid=1353, Unknown=0, NotChecked=0, Total=1892 [2020-06-22 08:52:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-06-22 08:52:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 51. [2020-06-22 08:52:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-06-22 08:52:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 83 transitions. [2020-06-22 08:52:03,021 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 83 transitions. Word has length 17 [2020-06-22 08:52:03,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:52:03,022 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 83 transitions. [2020-06-22 08:52:03,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-06-22 08:52:03,022 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 83 transitions. [2020-06-22 08:52:03,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 08:52:03,023 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:52:03,023 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:03,023 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:52:03,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:03,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1510663876, now seen corresponding path program 1 times [2020-06-22 08:52:03,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:03,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:03,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:03,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:03,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:03,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:52:03,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 08:52:03,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 08:52:03,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 08:52:03,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:52:03,090 INFO L87 Difference]: Start difference. First operand 51 states and 83 transitions. Second operand 8 states. [2020-06-22 08:52:03,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:03,318 INFO L93 Difference]: Finished difference Result 131 states and 217 transitions. [2020-06-22 08:52:03,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 08:52:03,319 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-06-22 08:52:03,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:52:03,320 INFO L225 Difference]: With dead ends: 131 [2020-06-22 08:52:03,320 INFO L226 Difference]: Without dead ends: 102 [2020-06-22 08:52:03,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-06-22 08:52:03,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-06-22 08:52:03,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. [2020-06-22 08:52:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-06-22 08:52:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 150 transitions. [2020-06-22 08:52:03,329 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 150 transitions. Word has length 20 [2020-06-22 08:52:03,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:52:03,330 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 150 transitions. [2020-06-22 08:52:03,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 08:52:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 150 transitions. [2020-06-22 08:52:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 08:52:03,331 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:52:03,331 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:03,331 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:52:03,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:03,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1539293027, now seen corresponding path program 1 times [2020-06-22 08:52:03,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:03,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:03,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:03,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:03,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:03,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:52:03,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 08:52:03,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 08:52:03,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 08:52:03,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:52:03,399 INFO L87 Difference]: Start difference. First operand 91 states and 150 transitions. Second operand 6 states. [2020-06-22 08:52:03,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:03,509 INFO L93 Difference]: Finished difference Result 155 states and 262 transitions. [2020-06-22 08:52:03,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 08:52:03,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-06-22 08:52:03,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:52:03,510 INFO L225 Difference]: With dead ends: 155 [2020-06-22 08:52:03,510 INFO L226 Difference]: Without dead ends: 81 [2020-06-22 08:52:03,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:52:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-06-22 08:52:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2020-06-22 08:52:03,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-06-22 08:52:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 134 transitions. [2020-06-22 08:52:03,517 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 134 transitions. Word has length 20 [2020-06-22 08:52:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:52:03,518 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 134 transitions. [2020-06-22 08:52:03,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 08:52:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 134 transitions. [2020-06-22 08:52:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 08:52:03,519 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:52:03,519 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:03,519 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:52:03,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:03,519 INFO L82 PathProgramCache]: Analyzing trace with hash -824761312, now seen corresponding path program 1 times [2020-06-22 08:52:03,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:03,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:03,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:03,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:03,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:03,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:03,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:52:03,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:52:03,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:03,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 25 conjunts are in the unsatisfiable core [2020-06-22 08:52:03,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:03,709 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:03,710 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 08:52:03,710 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:03,730 INFO L497 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2020-06-22 08:52:03,730 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:52:03,731 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 [2020-06-22 08:52:03,750 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 08:52:03,750 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:03,757 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:03,758 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 08:52:03,759 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2020-06-22 08:52:03,915 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:03,915 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 55 [2020-06-22 08:52:03,933 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:52:04,029 INFO L497 ElimStorePlain]: treesize reduction 8, result has 91.8 percent of original size [2020-06-22 08:52:04,032 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 08:52:04,032 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:89 [2020-06-22 08:52:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:04,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:52:04,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2020-06-22 08:52:04,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-06-22 08:52:04,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-06-22 08:52:04,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-06-22 08:52:04,220 INFO L87 Difference]: Start difference. First operand 80 states and 134 transitions. Second operand 16 states. [2020-06-22 08:52:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:09,044 INFO L93 Difference]: Finished difference Result 146 states and 249 transitions. [2020-06-22 08:52:09,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-06-22 08:52:09,044 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2020-06-22 08:52:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:52:09,046 INFO L225 Difference]: With dead ends: 146 [2020-06-22 08:52:09,046 INFO L226 Difference]: Without dead ends: 143 [2020-06-22 08:52:09,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=300, Invalid=691, Unknown=1, NotChecked=0, Total=992 [2020-06-22 08:52:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-06-22 08:52:09,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 103. [2020-06-22 08:52:09,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-06-22 08:52:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 167 transitions. [2020-06-22 08:52:09,055 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 167 transitions. Word has length 20 [2020-06-22 08:52:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:52:09,056 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 167 transitions. [2020-06-22 08:52:09,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-06-22 08:52:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 167 transitions. [2020-06-22 08:52:09,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-06-22 08:52:09,057 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:52:09,057 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:09,057 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:52:09,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:09,057 INFO L82 PathProgramCache]: Analyzing trace with hash -824761311, now seen corresponding path program 1 times [2020-06-22 08:52:09,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:09,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:09,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:09,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:09,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:09,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:52:09,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:52:09,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:09,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 08:52:09,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:09,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 08:52:09,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 08:52:09,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 08:52:09,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 08:52:09,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 08:52:09,186 INFO L87 Difference]: Start difference. First operand 103 states and 167 transitions. Second operand 6 states. [2020-06-22 08:52:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:52:09,305 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. [2020-06-22 08:52:09,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 08:52:09,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-06-22 08:52:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:52:09,306 INFO L225 Difference]: With dead ends: 105 [2020-06-22 08:52:09,306 INFO L226 Difference]: Without dead ends: 99 [2020-06-22 08:52:09,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 08:52:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-06-22 08:52:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2020-06-22 08:52:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-06-22 08:52:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2020-06-22 08:52:09,314 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 20 [2020-06-22 08:52:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:52:09,314 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2020-06-22 08:52:09,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 08:52:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2020-06-22 08:52:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-06-22 08:52:09,316 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:52:09,316 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:52:09,316 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:52:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:52:09,316 INFO L82 PathProgramCache]: Analyzing trace with hash 234545917, now seen corresponding path program 1 times [2020-06-22 08:52:09,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:52:09,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:52:09,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:09,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:09,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:52:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:52:09,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:52:09,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:52:09,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:52:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:52:09,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 37 conjunts are in the unsatisfiable core [2020-06-22 08:52:09,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:52:09,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:52:09,839 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 08:52:09,840 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:09,850 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:09,858 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 08:52:09,858 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:09,867 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:09,867 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:52:09,867 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-06-22 08:52:09,898 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 08:52:09,899 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:09,907 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:09,907 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:52:09,907 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-06-22 08:52:09,942 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-06-22 08:52:09,943 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:09,951 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:09,952 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:52:09,952 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-06-22 08:52:10,207 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:52:10,208 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 73 [2020-06-22 08:52:10,209 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:52:10,268 INFO L497 ElimStorePlain]: treesize reduction 8, result has 88.9 percent of original size [2020-06-22 08:52:10,269 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 08:52:10,270 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:64 [2020-06-22 08:52:15,330 WARN L188 SmtUtils]: Spent 5.02 s on a formula simplification that was a NOOP. DAG size: 40 [2020-06-22 08:52:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 08:52:15,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:52:15,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2020-06-22 08:52:15,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-06-22 08:52:15,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-06-22 08:52:15,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2020-06-22 08:52:15,385 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand 21 states. [2020-06-22 08:52:21,151 WARN L188 SmtUtils]: Spent 5.12 s on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2020-06-22 08:52:22,252 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2020-06-22 08:52:33,194 WARN L188 SmtUtils]: Spent 10.11 s on a formula simplification. DAG size of input: 109 DAG size of output: 69 [2020-06-22 08:53:04,529 WARN L188 SmtUtils]: Spent 10.09 s on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2020-06-22 08:53:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:53:04,756 INFO L93 Difference]: Finished difference Result 224 states and 287 transitions. [2020-06-22 08:53:04,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-06-22 08:53:04,757 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2020-06-22 08:53:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:53:04,759 INFO L225 Difference]: With dead ends: 224 [2020-06-22 08:53:04,759 INFO L226 Difference]: Without dead ends: 223 [2020-06-22 08:53:04,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 54.0s TimeCoverageRelationStatistics Valid=890, Invalid=2412, Unknown=4, NotChecked=0, Total=3306 [2020-06-22 08:53:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-06-22 08:53:04,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 113. [2020-06-22 08:53:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-06-22 08:53:04,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 156 transitions. [2020-06-22 08:53:04,770 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 156 transitions. Word has length 27 [2020-06-22 08:53:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:53:04,771 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 156 transitions. [2020-06-22 08:53:04,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-06-22 08:53:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 156 transitions. [2020-06-22 08:53:04,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-06-22 08:53:04,772 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:53:04,772 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:53:04,773 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:53:04,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:53:04,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1375365658, now seen corresponding path program 2 times [2020-06-22 08:53:04,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:53:04,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:53:04,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:04,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:53:04,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:53:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:53:04,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:53:04,969 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:53:04,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 08:53:05,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 08:53:05,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 08:53:05,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 08:53:05,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:53:05,055 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:53:05,055 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-06-22 08:53:05,055 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:53:05,073 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-06-22 08:53:05,074 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:53:05,074 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-06-22 08:53:05,090 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 08:53:05,090 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:53:05,092 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:53:05,092 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:53:05,093 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 08:53:05,266 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:53:05,267 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 52 [2020-06-22 08:53:05,274 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:53:05,306 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:53:05,308 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 08:53:05,308 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:69 [2020-06-22 08:53:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-06-22 08:53:05,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:53:05,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2020-06-22 08:53:05,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-06-22 08:53:05,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-06-22 08:53:05,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-06-22 08:53:05,423 INFO L87 Difference]: Start difference. First operand 113 states and 156 transitions. Second operand 16 states. [2020-06-22 08:53:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:53:06,773 INFO L93 Difference]: Finished difference Result 199 states and 282 transitions. [2020-06-22 08:53:06,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-06-22 08:53:06,773 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2020-06-22 08:53:06,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:53:06,774 INFO L225 Difference]: With dead ends: 199 [2020-06-22 08:53:06,774 INFO L226 Difference]: Without dead ends: 191 [2020-06-22 08:53:06,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=411, Invalid=921, Unknown=0, NotChecked=0, Total=1332 [2020-06-22 08:53:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-06-22 08:53:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 71. [2020-06-22 08:53:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-06-22 08:53:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2020-06-22 08:53:06,782 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 30 [2020-06-22 08:53:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:53:06,782 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2020-06-22 08:53:06,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-06-22 08:53:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2020-06-22 08:53:06,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-06-22 08:53:06,784 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:53:06,784 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:53:06,784 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION]=== [2020-06-22 08:53:06,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:53:06,784 INFO L82 PathProgramCache]: Analyzing trace with hash 487522126, now seen corresponding path program 1 times [2020-06-22 08:53:06,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:53:06,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:53:06,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:06,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:53:06,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:53:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-06-22 08:53:07,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 08:53:07,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 08:53:07,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:53:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:53:07,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 32 conjunts are in the unsatisfiable core [2020-06-22 08:53:07,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:53:07,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 08:53:07,124 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-06-22 08:53:07,124 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:53:07,133 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:53:07,138 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-06-22 08:53:07,139 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 08:53:07,146 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:53:07,147 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:53:07,147 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-06-22 08:53:07,175 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 08:53:07,175 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:53:07,182 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:53:07,183 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:53:07,183 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-06-22 08:53:07,213 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-06-22 08:53:07,214 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 08:53:07,220 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:53:07,221 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 08:53:07,221 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-06-22 08:53:07,274 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:53:07,274 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-06-22 08:53:07,275 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 08:53:07,283 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 08:53:07,283 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 08:53:07,283 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2020-06-22 08:53:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-06-22 08:53:07,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 08:53:07,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2020-06-22 08:53:07,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 08:53:07,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 08:53:07,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2020-06-22 08:53:07,377 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand 18 states. [2020-06-22 08:53:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:53:07,741 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. [2020-06-22 08:53:07,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 08:53:07,741 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2020-06-22 08:53:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:53:07,742 INFO L225 Difference]: With dead ends: 79 [2020-06-22 08:53:07,742 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 08:53:07,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2020-06-22 08:53:07,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 08:53:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 08:53:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 08:53:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 08:53:07,743 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2020-06-22 08:53:07,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:53:07,744 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:53:07,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 08:53:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:53:07,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 08:53:07,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 08:53:07,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 08:53:07,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 08:53:07,990 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 203 [2020-06-22 08:53:10,088 WARN L188 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 201 DAG size of output: 104 [2020-06-22 08:53:10,093 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 25 27) no Hoare annotation was computed. [2020-06-22 08:53:10,093 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 08:53:10,093 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-06-22 08:53:10,093 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 08:53:10,093 INFO L448 ceAbstractionStarter]: For program point L9-2(line 9) no Hoare annotation was computed. [2020-06-22 08:53:10,093 INFO L448 ceAbstractionStarter]: For program point L9-3(line 9) no Hoare annotation was computed. [2020-06-22 08:53:10,093 INFO L448 ceAbstractionStarter]: For program point L9-4(line 9) no Hoare annotation was computed. [2020-06-22 08:53:10,093 INFO L448 ceAbstractionStarter]: For program point L9-6(lines 9 14) no Hoare annotation was computed. [2020-06-22 08:53:10,094 INFO L444 ceAbstractionStarter]: At program point L9-8(lines 9 14) the Hoare annotation is: (let ((.cse25 (select |#memory_int| ULTIMATE.start_subseq_~pt~0.base)) (.cse26 (select |#length| ULTIMATE.start_subseq_~pt~0.base)) (.cse24 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse27 (select |#memory_int| ULTIMATE.start_subseq_~ps~0.base)) (.cse21 (select |#length| ULTIMATE.start_subseq_~ps~0.base))) (let ((.cse2 (= (select .cse27 (+ .cse21 (- 1))) 0)) (.cse3 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_subseq_~ps~0.base))))) (.cse19 (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse24 (- 1))) 0)) (.cse4 (<= (+ ULTIMATE.start_subseq_~pt~0.offset 1) .cse26)) (.cse5 (<= 1 ULTIMATE.start_subseq_~pt~0.offset)) (.cse16 (= (select .cse25 (+ .cse26 (- 1))) 0)) (.cse15 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse17 (= 0 ULTIMATE.start_subseq_~pt~0.offset)) (.cse7 (= 1 (select |#valid| ULTIMATE.start_subseq_~ps~0.base))) (.cse8 (= ULTIMATE.start_main_~length1~0 .cse24)) (.cse9 (= 1 (select |#valid| ULTIMATE.start_subseq_~pt~0.base))) (.cse20 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse10 (= ULTIMATE.start_subseq_~ps~0.offset 0)) (.cse23 (= 0 (select .cse27 ULTIMATE.start_subseq_~ps~0.offset))) (.cse1 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse22 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~nondetString1~0.offset))) (.cse11 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse12 (<= (+ ULTIMATE.start_main_~nondetString1~0.offset 1) .cse24)) (.cse0 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse6 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse18 (<= 1 .cse26)) (.cse13 (<= 1 .cse21)) (.cse14 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))) (or (and .cse0 .cse1 .cse2 .cse3 (or (and .cse4 (and .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) .cse16) (and .cse17 .cse7 .cse8 .cse9 .cse10 .cse15 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_subseq_~pt~0.base) (+ (select |#length| ULTIMATE.start_subseq_~pt~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= ULTIMATE.start_subseq_~pt~0.offset ULTIMATE.start_main_~nondetString2~0.offset))) .cse11 .cse12 .cse6 .cse18 .cse13 .cse14)) .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse19 (and .cse4 .cse5 (and (<= 1 ULTIMATE.start_subseq_~ps~0.offset) .cse7 .cse8 .cse9 .cse20 (<= (+ ULTIMATE.start_subseq_~ps~0.offset 1) .cse21) .cse15 .cse11 .cse12 .cse0 .cse6 .cse14) .cse16)) (and .cse17 .cse7 .cse8 .cse1 .cse9 .cse22 .cse20 .cse10 .cse15 .cse23 (= 1 ULTIMATE.start_main_~length1~0) .cse11 .cse0 .cse6 .cse18 .cse13 .cse14) (and .cse17 .cse7 .cse8 .cse9 .cse20 .cse10 (or (<= 2 .cse21) .cse23) (or (<= 2 .cse24) (and .cse1 .cse22)) (= ULTIMATE.start_main_~length2~0 1) .cse11 .cse12 .cse0 .cse6 (= (select .cse25 ULTIMATE.start_subseq_~pt~0.offset) 0) .cse18 .cse13 .cse14)))) [2020-06-22 08:53:10,094 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:53:10,094 INFO L448 ceAbstractionStarter]: For program point L9-9(lines 9 14) no Hoare annotation was computed. [2020-06-22 08:53:10,094 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:53:10,094 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:53:10,094 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2020-06-22 08:53:10,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 08:53:10,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 08:53:10,095 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2020-06-22 08:53:10,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 08:53:10,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 08:53:10,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 08:53:10,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 08:53:10,095 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2020-06-22 08:53:10,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 08:53:10,095 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 08:53:10,096 INFO L448 ceAbstractionStarter]: For program point L22-2(lines 19 33) no Hoare annotation was computed. [2020-06-22 08:53:10,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 08:53:10,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 08:53:10,096 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 08:53:10,096 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-06-22 08:53:10,096 INFO L448 ceAbstractionStarter]: For program point L10-2(lines 10 12) no Hoare annotation was computed. [2020-06-22 08:53:10,096 INFO L448 ceAbstractionStarter]: For program point L10-4(lines 10 12) no Hoare annotation was computed. [2020-06-22 08:53:10,097 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 08:53:10,108 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:10,109 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:10,110 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:10,110 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:10,111 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:10,111 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:10,111 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:10,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:10,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:10,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:10,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:10,120 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,120 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,122 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,123 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,123 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,123 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,124 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,124 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,124 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,124 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,124 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,125 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,125 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,125 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,125 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,125 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,126 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,126 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,126 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,126 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,127 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,127 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,127 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,127 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,127 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,129 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,131 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,131 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,131 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,131 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,131 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:10,144 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:10,144 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:10,144 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:10,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:10,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:10,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:10,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:10,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:10,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:10,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:10,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,151 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,152 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,153 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,154 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,155 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,156 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,157 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,158 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,158 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,158 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,158 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,159 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,160 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:10,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,161 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:10,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:53:10 BasicIcfg [2020-06-22 08:53:10,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 08:53:10,166 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 08:53:10,166 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 08:53:10,169 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 08:53:10,170 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:53:10,170 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 08:51:56" (1/5) ... [2020-06-22 08:53:10,171 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35558876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:53:10, skipping insertion in model container [2020-06-22 08:53:10,171 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:53:10,171 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:51:56" (2/5) ... [2020-06-22 08:53:10,171 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35558876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:53:10, skipping insertion in model container [2020-06-22 08:53:10,172 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:53:10,172 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:51:56" (3/5) ... [2020-06-22 08:53:10,172 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35558876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:53:10, skipping insertion in model container [2020-06-22 08:53:10,172 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:53:10,172 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:51:57" (4/5) ... [2020-06-22 08:53:10,172 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35558876 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:53:10, skipping insertion in model container [2020-06-22 08:53:10,173 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:53:10,173 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:53:10" (5/5) ... [2020-06-22 08:53:10,174 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:53:10,196 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:53:10,196 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 08:53:10,196 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 08:53:10,197 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:53:10,197 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:53:10,197 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:53:10,197 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 08:53:10,197 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:53:10,197 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 08:53:10,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-06-22 08:53:10,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:53:10,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:53:10,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:53:10,210 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:53:10,210 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:53:10,211 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 08:53:10,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2020-06-22 08:53:10,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:53:10,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:53:10,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:53:10,213 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:53:10,213 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:53:10,218 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [182] ULTIMATE.startENTRY-->L22: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 29#L22true [119] L22-->L22-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 10#L22-2true [120] L22-2-->L25-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 15#L25-1true [143] L25-1-->L30: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc10.base_4|) 0) (= (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc10.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_2|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (> |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_4| 1) |v_#valid_6|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 25#L30true [109] L30-->L30-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_5|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 21#L30-1true [183] L30-1-->L9-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_subseq_#in~s.offset_2|) (<= 1 .cse0) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_subseq_#in~s.base_2| v_ULTIMATE.start_subseq_~s.base_3) (= v_ULTIMATE.start_subseq_~s.base_3 v_ULTIMATE.start_subseq_~ps~0.base_11) (= |v_ULTIMATE.start_subseq_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= |v_ULTIMATE.start_subseq_#in~t.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_subseq_#in~t.base_2| v_ULTIMATE.start_subseq_~t.base_3) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_subseq_#in~t.offset_2|) (= v_ULTIMATE.start_subseq_~t.offset_3 |v_ULTIMATE.start_subseq_#in~t.offset_2|) (= v_ULTIMATE.start_subseq_~pt~0.offset_11 v_ULTIMATE.start_subseq_~t.offset_3) (= v_ULTIMATE.start_subseq_~s.offset_3 v_ULTIMATE.start_subseq_~ps~0.offset_9) (= v_ULTIMATE.start_subseq_~s.offset_3 |v_ULTIMATE.start_subseq_#in~s.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_subseq_~pt~0.base_14 v_ULTIMATE.start_subseq_~t.base_3))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_subseq_#t~post6.base=|v_ULTIMATE.start_subseq_#t~post6.base_4|, ULTIMATE.start_subseq_#in~s.offset=|v_ULTIMATE.start_subseq_#in~s.offset_2|, ULTIMATE.start_subseq_#t~post5.base=|v_ULTIMATE.start_subseq_#t~post5.base_4|, ULTIMATE.start_subseq_#in~s.base=|v_ULTIMATE.start_subseq_#in~s.base_2|, ULTIMATE.start_subseq_#in~t.base=|v_ULTIMATE.start_subseq_#in~t.base_2|, ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_10|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_9, ULTIMATE.start_subseq_#t~post6.offset=|v_ULTIMATE.start_subseq_#t~post6.offset_4|, ULTIMATE.start_subseq_~s.offset=v_ULTIMATE.start_subseq_~s.offset_3, ULTIMATE.start_subseq_#in~t.offset=|v_ULTIMATE.start_subseq_#in~t.offset_2|, ULTIMATE.start_subseq_~s.base=v_ULTIMATE.start_subseq_~s.base_3, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_subseq_~t.base=v_ULTIMATE.start_subseq_~t.base_3, ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_14, ULTIMATE.start_subseq_#t~mem7=|v_ULTIMATE.start_subseq_#t~mem7_7|, ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_7|, ULTIMATE.start_subseq_#t~post5.offset=|v_ULTIMATE.start_subseq_#t~post5.offset_4|, ULTIMATE.start_subseq_#res=|v_ULTIMATE.start_subseq_#res_5|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_7|, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_6|, #valid=|v_#valid_25|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_6|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_subseq_~t.offset=v_ULTIMATE.start_subseq_~t.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~post6.base, ULTIMATE.start_subseq_~ps~0.offset, ULTIMATE.start_subseq_#t~post6.offset, ULTIMATE.start_subseq_#in~s.offset, ULTIMATE.start_subseq_#t~post5.base, ULTIMATE.start_subseq_~s.offset, ULTIMATE.start_subseq_#in~s.base, ULTIMATE.start_subseq_#in~t.base, ULTIMATE.start_subseq_#in~t.offset, ULTIMATE.start_subseq_~s.base, ULTIMATE.start_subseq_~t.base, ULTIMATE.start_subseq_#t~short2, ULTIMATE.start_subseq_~pt~0.base, ULTIMATE.start_subseq_~pt~0.offset, ULTIMATE.start_subseq_#t~mem7, ULTIMATE.start_subseq_#t~mem4, ULTIMATE.start_subseq_#t~post5.offset, ULTIMATE.start_subseq_#res, ULTIMATE.start_subseq_#t~mem3, ULTIMATE.start_subseq_#t~mem1, ULTIMATE.start_subseq_#t~mem0, #memory_int, ULTIMATE.start_subseq_~ps~0.base, ULTIMATE.start_subseq_~t.offset] 14#L9-8true [2020-06-22 08:53:10,219 INFO L796 eck$LassoCheckResult]: Loop: 14#L9-8true [94] L9-8-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_subseq_~ps~0.offset_3 1) (select |v_#length_9| v_ULTIMATE.start_subseq_~ps~0.base_3)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_subseq_~ps~0.base_3) v_ULTIMATE.start_subseq_~ps~0.offset_3) |v_ULTIMATE.start_subseq_#t~mem0_2|) (<= 0 v_ULTIMATE.start_subseq_~ps~0.offset_3) (= 1 (select |v_#valid_13| v_ULTIMATE.start_subseq_~ps~0.base_3))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_3, #length=|v_#length_9|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_3, #valid=|v_#valid_13|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_2|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem0] 9#L9-1true [160] L9-1-->L9-2: Formula: (and (not |v_ULTIMATE.start_subseq_#t~short2_2|) (= 0 |v_ULTIMATE.start_subseq_#t~mem0_3|)) InVars {ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_3|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_2|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_3|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~short2] 8#L9-2true [81] L9-2-->L9-6: Formula: (not |v_ULTIMATE.start_subseq_#t~short2_5|) InVars {ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_5|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_5|} AuxVars[] AssignedVars[] 16#L9-6true [99] L9-6-->L10: Formula: |v_ULTIMATE.start_subseq_#t~short2_9| InVars {ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_9|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_8|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_5|, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~short2, ULTIMATE.start_subseq_#t~mem1, ULTIMATE.start_subseq_#t~mem0] 12#L10true [86] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_subseq_~ps~0.base_6)) (<= (+ v_ULTIMATE.start_subseq_~ps~0.offset_5 1) (select |v_#length_13| v_ULTIMATE.start_subseq_~ps~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subseq_~ps~0.base_6) v_ULTIMATE.start_subseq_~ps~0.offset_5) |v_ULTIMATE.start_subseq_#t~mem3_2|) (<= 0 v_ULTIMATE.start_subseq_~ps~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_5, #length=|v_#length_13|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_5, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem3] 26#L10-1true [112] L10-1-->L10-2: Formula: (and (<= (+ v_ULTIMATE.start_subseq_~pt~0.offset_6 1) (select |v_#length_15| v_ULTIMATE.start_subseq_~pt~0.base_7)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_subseq_~pt~0.base_7) v_ULTIMATE.start_subseq_~pt~0.offset_6) |v_ULTIMATE.start_subseq_#t~mem4_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_subseq_~pt~0.base_7)) (<= 0 v_ULTIMATE.start_subseq_~pt~0.offset_6)) InVars {ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_7, #memory_int=|v_#memory_int_8|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_7, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_6, ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem4] 23#L10-2true [180] L10-2-->L10-4: Formula: (< |v_ULTIMATE.start_subseq_#t~mem3_6| |v_ULTIMATE.start_subseq_#t~mem4_6|) InVars {ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_6|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_6|} OutVars{ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_5|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem4, ULTIMATE.start_subseq_#t~mem3] 18#L10-4true [103] L10-4-->L9-8: Formula: (and (= v_ULTIMATE.start_subseq_~pt~0.base_11 v_ULTIMATE.start_subseq_~pt~0.base_10) (= (+ v_ULTIMATE.start_subseq_~pt~0.offset_9 1) v_ULTIMATE.start_subseq_~pt~0.offset_8)) InVars {ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_11, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_9} OutVars{ULTIMATE.start_subseq_#t~post6.base=|v_ULTIMATE.start_subseq_#t~post6.base_2|, ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_10, ULTIMATE.start_subseq_#t~post6.offset=|v_ULTIMATE.start_subseq_#t~post6.offset_2|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~post6.base, ULTIMATE.start_subseq_~pt~0.base, ULTIMATE.start_subseq_#t~post6.offset, ULTIMATE.start_subseq_~pt~0.offset] 14#L9-8true [2020-06-22 08:53:10,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:53:10,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1916656771, now seen corresponding path program 1 times [2020-06-22 08:53:10,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:53:10,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:53:10,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:10,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:53:10,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:53:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:53:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:53:10,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1487693122, now seen corresponding path program 1 times [2020-06-22 08:53:10,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:53:10,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:53:10,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:10,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:53:10,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:53:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:53:10,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:53:10,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:53:10,263 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 08:53:10,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:53:10,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:53:10,265 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2020-06-22 08:53:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:53:10,351 INFO L93 Difference]: Finished difference Result 33 states and 59 transitions. [2020-06-22 08:53:10,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:53:10,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 59 transitions. [2020-06-22 08:53:10,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:53:10,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 16 states and 25 transitions. [2020-06-22 08:53:10,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-06-22 08:53:10,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 08:53:10,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 25 transitions. [2020-06-22 08:53:10,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:53:10,358 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. [2020-06-22 08:53:10,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 25 transitions. [2020-06-22 08:53:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 08:53:10,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 08:53:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2020-06-22 08:53:10,360 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. [2020-06-22 08:53:10,360 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. [2020-06-22 08:53:10,360 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 08:53:10,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 25 transitions. [2020-06-22 08:53:10,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 08:53:10,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:53:10,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:53:10,362 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 08:53:10,362 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:53:10,363 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRY [182] ULTIMATE.startENTRY-->L22: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 88#L22 [119] L22-->L22-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 84#L22-2 [120] L22-2-->L25-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 85#L25-1 [143] L25-1-->L30: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc10.base_4|) 0) (= (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc10.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_2|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (> |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_4| 1) |v_#valid_6|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 82#L30 [109] L30-->L30-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_5|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 79#L30-1 [183] L30-1-->L9-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_subseq_#in~s.offset_2|) (<= 1 .cse0) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_subseq_#in~s.base_2| v_ULTIMATE.start_subseq_~s.base_3) (= v_ULTIMATE.start_subseq_~s.base_3 v_ULTIMATE.start_subseq_~ps~0.base_11) (= |v_ULTIMATE.start_subseq_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= |v_ULTIMATE.start_subseq_#in~t.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_subseq_#in~t.base_2| v_ULTIMATE.start_subseq_~t.base_3) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_subseq_#in~t.offset_2|) (= v_ULTIMATE.start_subseq_~t.offset_3 |v_ULTIMATE.start_subseq_#in~t.offset_2|) (= v_ULTIMATE.start_subseq_~pt~0.offset_11 v_ULTIMATE.start_subseq_~t.offset_3) (= v_ULTIMATE.start_subseq_~s.offset_3 v_ULTIMATE.start_subseq_~ps~0.offset_9) (= v_ULTIMATE.start_subseq_~s.offset_3 |v_ULTIMATE.start_subseq_#in~s.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_subseq_~pt~0.base_14 v_ULTIMATE.start_subseq_~t.base_3))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_subseq_#t~post6.base=|v_ULTIMATE.start_subseq_#t~post6.base_4|, ULTIMATE.start_subseq_#in~s.offset=|v_ULTIMATE.start_subseq_#in~s.offset_2|, ULTIMATE.start_subseq_#t~post5.base=|v_ULTIMATE.start_subseq_#t~post5.base_4|, ULTIMATE.start_subseq_#in~s.base=|v_ULTIMATE.start_subseq_#in~s.base_2|, ULTIMATE.start_subseq_#in~t.base=|v_ULTIMATE.start_subseq_#in~t.base_2|, ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_10|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_9, ULTIMATE.start_subseq_#t~post6.offset=|v_ULTIMATE.start_subseq_#t~post6.offset_4|, ULTIMATE.start_subseq_~s.offset=v_ULTIMATE.start_subseq_~s.offset_3, ULTIMATE.start_subseq_#in~t.offset=|v_ULTIMATE.start_subseq_#in~t.offset_2|, ULTIMATE.start_subseq_~s.base=v_ULTIMATE.start_subseq_~s.base_3, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_subseq_~t.base=v_ULTIMATE.start_subseq_~t.base_3, ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_14, ULTIMATE.start_subseq_#t~mem7=|v_ULTIMATE.start_subseq_#t~mem7_7|, ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_7|, ULTIMATE.start_subseq_#t~post5.offset=|v_ULTIMATE.start_subseq_#t~post5.offset_4|, ULTIMATE.start_subseq_#res=|v_ULTIMATE.start_subseq_#res_5|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_7|, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_6|, #valid=|v_#valid_25|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_6|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_subseq_~t.offset=v_ULTIMATE.start_subseq_~t.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~post6.base, ULTIMATE.start_subseq_~ps~0.offset, ULTIMATE.start_subseq_#t~post6.offset, ULTIMATE.start_subseq_#in~s.offset, ULTIMATE.start_subseq_#t~post5.base, ULTIMATE.start_subseq_~s.offset, ULTIMATE.start_subseq_#in~s.base, ULTIMATE.start_subseq_#in~t.base, ULTIMATE.start_subseq_#in~t.offset, ULTIMATE.start_subseq_~s.base, ULTIMATE.start_subseq_~t.base, ULTIMATE.start_subseq_#t~short2, ULTIMATE.start_subseq_~pt~0.base, ULTIMATE.start_subseq_~pt~0.offset, ULTIMATE.start_subseq_#t~mem7, ULTIMATE.start_subseq_#t~mem4, ULTIMATE.start_subseq_#t~post5.offset, ULTIMATE.start_subseq_#res, ULTIMATE.start_subseq_#t~mem3, ULTIMATE.start_subseq_#t~mem1, ULTIMATE.start_subseq_#t~mem0, #memory_int, ULTIMATE.start_subseq_~ps~0.base, ULTIMATE.start_subseq_~t.offset] 76#L9-8 [2020-06-22 08:53:10,363 INFO L796 eck$LassoCheckResult]: Loop: 76#L9-8 [94] L9-8-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_subseq_~ps~0.offset_3 1) (select |v_#length_9| v_ULTIMATE.start_subseq_~ps~0.base_3)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_subseq_~ps~0.base_3) v_ULTIMATE.start_subseq_~ps~0.offset_3) |v_ULTIMATE.start_subseq_#t~mem0_2|) (<= 0 v_ULTIMATE.start_subseq_~ps~0.offset_3) (= 1 (select |v_#valid_13| v_ULTIMATE.start_subseq_~ps~0.base_3))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_3, #length=|v_#length_9|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_3, #valid=|v_#valid_13|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_2|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem0] 81#L9-1 [161] L9-1-->L9-2: Formula: (and |v_ULTIMATE.start_subseq_#t~short2_2| (< 0 |v_ULTIMATE.start_subseq_#t~mem0_3|)) InVars {ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_3|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_2|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_3|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~short2] 78#L9-2 [80] L9-2-->L9-3: Formula: |v_ULTIMATE.start_subseq_#t~short2_3| InVars {ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_3|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_3|} AuxVars[] AssignedVars[] 77#L9-3 [77] L9-3-->L9-4: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_subseq_~pt~0.base_4) v_ULTIMATE.start_subseq_~pt~0.offset_4) |v_ULTIMATE.start_subseq_#t~mem1_2|) (= 1 (select |v_#valid_15| v_ULTIMATE.start_subseq_~pt~0.base_4)) (<= 0 v_ULTIMATE.start_subseq_~pt~0.offset_4) (<= (+ v_ULTIMATE.start_subseq_~pt~0.offset_4 1) (select |v_#length_11| v_ULTIMATE.start_subseq_~pt~0.base_4))) InVars {ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_4, #memory_int=|v_#memory_int_6|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_4, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_4, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem1] 73#L9-4 [170] L9-4-->L9-6: Formula: (and (< 0 |v_ULTIMATE.start_subseq_#t~mem1_3|) |v_ULTIMATE.start_subseq_#t~short2_4|) InVars {ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_3|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_4|, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_3|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~short2] 74#L9-6 [99] L9-6-->L10: Formula: |v_ULTIMATE.start_subseq_#t~short2_9| InVars {ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_9|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_8|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_5|, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~short2, ULTIMATE.start_subseq_#t~mem1, ULTIMATE.start_subseq_#t~mem0] 86#L10 [86] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_subseq_~ps~0.base_6)) (<= (+ v_ULTIMATE.start_subseq_~ps~0.offset_5 1) (select |v_#length_13| v_ULTIMATE.start_subseq_~ps~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subseq_~ps~0.base_6) v_ULTIMATE.start_subseq_~ps~0.offset_5) |v_ULTIMATE.start_subseq_#t~mem3_2|) (<= 0 v_ULTIMATE.start_subseq_~ps~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_5, #length=|v_#length_13|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_5, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem3] 83#L10-1 [112] L10-1-->L10-2: Formula: (and (<= (+ v_ULTIMATE.start_subseq_~pt~0.offset_6 1) (select |v_#length_15| v_ULTIMATE.start_subseq_~pt~0.base_7)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_subseq_~pt~0.base_7) v_ULTIMATE.start_subseq_~pt~0.offset_6) |v_ULTIMATE.start_subseq_#t~mem4_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_subseq_~pt~0.base_7)) (<= 0 v_ULTIMATE.start_subseq_~pt~0.offset_6)) InVars {ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_7, #memory_int=|v_#memory_int_8|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_7, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_6, ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem4] 80#L10-2 [180] L10-2-->L10-4: Formula: (< |v_ULTIMATE.start_subseq_#t~mem3_6| |v_ULTIMATE.start_subseq_#t~mem4_6|) InVars {ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_6|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_6|} OutVars{ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_5|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem4, ULTIMATE.start_subseq_#t~mem3] 75#L10-4 [103] L10-4-->L9-8: Formula: (and (= v_ULTIMATE.start_subseq_~pt~0.base_11 v_ULTIMATE.start_subseq_~pt~0.base_10) (= (+ v_ULTIMATE.start_subseq_~pt~0.offset_9 1) v_ULTIMATE.start_subseq_~pt~0.offset_8)) InVars {ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_11, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_9} OutVars{ULTIMATE.start_subseq_#t~post6.base=|v_ULTIMATE.start_subseq_#t~post6.base_2|, ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_10, ULTIMATE.start_subseq_#t~post6.offset=|v_ULTIMATE.start_subseq_#t~post6.offset_2|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~post6.base, ULTIMATE.start_subseq_~pt~0.base, ULTIMATE.start_subseq_#t~post6.offset, ULTIMATE.start_subseq_~pt~0.offset] 76#L9-8 [2020-06-22 08:53:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:53:10,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1916656771, now seen corresponding path program 2 times [2020-06-22 08:53:10,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:53:10,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:53:10,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:10,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:53:10,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:53:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:53:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:53:10,377 INFO L82 PathProgramCache]: Analyzing trace with hash 238528263, now seen corresponding path program 1 times [2020-06-22 08:53:10,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:53:10,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:53:10,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:10,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:53:10,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:10,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:53:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:53:10,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:53:10,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1107998455, now seen corresponding path program 1 times [2020-06-22 08:53:10,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:53:10,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:53:10,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:10,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:53:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:53:10,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:53:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:53:10,777 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2020-06-22 08:53:10,883 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-06-22 08:53:10,896 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 08:53:10,897 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 08:53:10,897 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 08:53:10,897 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 08:53:10,897 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 08:53:10,897 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 08:53:10,897 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 08:53:10,898 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 08:53:10,898 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso [2020-06-22 08:53:10,898 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 08:53:10,898 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 08:53:10,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:10,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:11,239 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2020-06-22 08:53:11,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:11,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:11,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 08:53:11,770 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 08:53:11,775 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 08:53:11,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:53:11,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:53:11,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:53:11,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:53:11,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:53:11,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:53:11,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:53:11,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:53:11,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:53:11,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:53:11,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:53:11,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:53:11,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:53:11,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:53:11,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:53:11,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:53:11,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:53:11,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:53:11,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:53:11,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:53:11,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:53:11,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:53:11,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:53:11,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:53:11,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:53:11,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:53:11,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:53:11,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:53:11,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:53:11,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:53:11,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:53:11,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:53:11,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:53:11,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:53:11,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:53:11,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:53:11,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:53:11,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:53:11,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:53:11,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:53:11,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 08:53:11,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 08:53:11,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 08:53:11,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:53:11,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:53:11,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:53:11,838 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:53:11,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:53:11,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:53:11,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:53:11,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:53:11,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:53:11,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:53:11,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:53:11,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:53:11,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:53:11,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:53:11,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 08:53:11,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 08:53:11,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 08:53:11,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 08:53:11,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 08:53:11,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 08:53:11,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 08:53:11,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 08:53:11,919 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 08:53:11,947 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 08:53:11,947 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 08:53:11,950 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 08:53:11,951 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 08:53:11,952 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 08:53:11,952 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_subseq_~pt~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1) = -1*ULTIMATE.start_subseq_~pt~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 Supporting invariants [] [2020-06-22 08:53:12,011 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2020-06-22 08:53:12,014 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:53:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:53:12,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 08:53:12,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:53:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:53:12,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:53:12,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:53:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:53:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:53:12,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:53:12,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:53:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:53:12,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:53:12,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:53:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:53:12,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 08:53:12,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 08:53:12,242 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 08:53:12,246 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-06-22 08:53:12,247 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-06-22 08:53:12,339 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 25 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 26 states and 40 transitions. Complement of second has 7 states. [2020-06-22 08:53:12,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 08:53:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 08:53:12,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-06-22 08:53:12,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 6 letters. Loop has 10 letters. [2020-06-22 08:53:12,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:53:12,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 16 letters. Loop has 10 letters. [2020-06-22 08:53:12,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:53:12,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 6 letters. Loop has 20 letters. [2020-06-22 08:53:12,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 08:53:12,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 40 transitions. [2020-06-22 08:53:12,351 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:53:12,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2020-06-22 08:53:12,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 08:53:12,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 08:53:12,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 08:53:12,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:53:12,352 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:53:12,352 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:53:12,352 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:53:12,352 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 08:53:12,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:53:12,352 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 08:53:12,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 08:53:12,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:53:12 BasicIcfg [2020-06-22 08:53:12,359 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 08:53:12,359 INFO L168 Benchmark]: Toolchain (without parser) took 76110.47 ms. Allocated memory was 649.6 MB in the beginning and 842.0 MB in the end (delta: 192.4 MB). Free memory was 558.9 MB in the beginning and 392.8 MB in the end (delta: 166.1 MB). Peak memory consumption was 358.5 MB. Max. memory is 50.3 GB. [2020-06-22 08:53:12,360 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:53:12,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.45 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 558.9 MB in the beginning and 640.6 MB in the end (delta: -81.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-06-22 08:53:12,361 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.68 ms. Allocated memory is still 678.4 MB. Free memory was 640.6 MB in the beginning and 639.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:53:12,361 INFO L168 Benchmark]: Boogie Preprocessor took 25.52 ms. Allocated memory is still 678.4 MB. Free memory was 639.2 MB in the beginning and 637.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 08:53:12,362 INFO L168 Benchmark]: RCFGBuilder took 336.13 ms. Allocated memory is still 678.4 MB. Free memory was 637.9 MB in the beginning and 613.1 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. [2020-06-22 08:53:12,362 INFO L168 Benchmark]: BlockEncodingV2 took 121.97 ms. Allocated memory is still 678.4 MB. Free memory was 613.1 MB in the beginning and 603.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. [2020-06-22 08:53:12,362 INFO L168 Benchmark]: TraceAbstraction took 73073.61 ms. Allocated memory was 678.4 MB in the beginning and 854.1 MB in the end (delta: 175.6 MB). Free memory was 603.6 MB in the beginning and 395.6 MB in the end (delta: 208.0 MB). Peak memory consumption was 383.6 MB. Max. memory is 50.3 GB. [2020-06-22 08:53:12,363 INFO L168 Benchmark]: BuchiAutomizer took 2192.94 ms. Allocated memory was 854.1 MB in the beginning and 842.0 MB in the end (delta: -12.1 MB). Free memory was 395.6 MB in the beginning and 392.8 MB in the end (delta: 2.8 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:53:12,366 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 38 locations, 44 edges - StatisticsResult: Encoded RCFG 31 locations, 57 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 314.45 ms. Allocated memory was 649.6 MB in the beginning and 678.4 MB in the end (delta: 28.8 MB). Free memory was 558.9 MB in the beginning and 640.6 MB in the end (delta: -81.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.68 ms. Allocated memory is still 678.4 MB. Free memory was 640.6 MB in the beginning and 639.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.52 ms. Allocated memory is still 678.4 MB. Free memory was 639.2 MB in the beginning and 637.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 336.13 ms. Allocated memory is still 678.4 MB. Free memory was 637.9 MB in the beginning and 613.1 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 121.97 ms. Allocated memory is still 678.4 MB. Free memory was 613.1 MB in the beginning and 603.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 73073.61 ms. Allocated memory was 678.4 MB in the beginning and 854.1 MB in the end (delta: 175.6 MB). Free memory was 603.6 MB in the beginning and 395.6 MB in the end (delta: 208.0 MB). Peak memory consumption was 383.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2192.94 ms. Allocated memory was 854.1 MB in the beginning and 842.0 MB in the end (delta: -12.1 MB). Free memory was 395.6 MB in the beginning and 392.8 MB in the end (delta: 2.8 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-06-22 08:53:12,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:12,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:12,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:12,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:12,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:12,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:12,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:12,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:12,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:12,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:12,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:12,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,383 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,384 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,385 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,386 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,390 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:12,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:12,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:12,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:12,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:12,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:12,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:12,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:12,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:12,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-06-22 08:53:12,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-06-22 08:53:12,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,398 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,399 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,400 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,401 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,402 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,403 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,404 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,405 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,406 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 08:53:12,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:53:12,407 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((nondetString1 == 0 && !(nondetString1 == nondetString2)) && unknown-#memory_int-unknown[ps][unknown-#length-unknown[ps] + -1] == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == ps))) && (((pt + 1 <= unknown-#length-unknown[pt] && ((1 <= pt && nondetString2 == 0) && ((((((1 == \valid[ps] && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[pt]) && ps == 0) && 1 == \valid[nondetString1]) && nondetString1 + 1 <= unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[ps]) && 1 == \valid[nondetString2]) && 1 <= length2) && unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1] == 0) || ((((((((((((0 == pt && 1 == \valid[ps]) && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[pt]) && ps == 0) && 1 <= length2) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (0 == unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && pt <= ULTIMATE.start_main_~nondetString2~0.offset)) && 1 == \valid[nondetString1]) && nondetString1 + 1 <= unknown-#length-unknown[nondetString1]) && nondetString2 == 0) && 1 <= unknown-#length-unknown[pt]) && 1 <= unknown-#length-unknown[ps]) && 1 == \valid[nondetString2]))) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && unknown-#length-unknown[nondetString2] == length2) || ((((!(nondetString1 == nondetString2) && unknown-#memory_int-unknown[ps][unknown-#length-unknown[ps] + -1] == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == ps))) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && ((pt + 1 <= unknown-#length-unknown[pt] && 1 <= pt) && ((((((((((1 <= ps && 1 == \valid[ps]) && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[pt]) && unknown-#length-unknown[nondetString2] == length2) && ps + 1 <= unknown-#length-unknown[ps]) && 1 <= length2) && 1 == \valid[nondetString1]) && nondetString1 + 1 <= unknown-#length-unknown[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[nondetString2]) && unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1] == 0)) || ((((((((((((((((0 == pt && 1 == \valid[ps]) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && 1 == \valid[pt]) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && ps == 0) && 1 <= length2) && 0 == unknown-#memory_int-unknown[ps][ps]) && 1 == length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 <= unknown-#length-unknown[pt]) && 1 <= unknown-#length-unknown[ps]) && 1 == \valid[nondetString2])) || ((((((((((((((((0 == pt && 1 == \valid[ps]) && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[pt]) && unknown-#length-unknown[nondetString2] == length2) && ps == 0) && (2 <= unknown-#length-unknown[ps] || 0 == unknown-#memory_int-unknown[ps][ps])) && (2 <= unknown-#length-unknown[nondetString1] || (!(nondetString1 == nondetString2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]))) && length2 == 1) && 1 == \valid[nondetString1]) && nondetString1 + 1 <= unknown-#length-unknown[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && unknown-#memory_int-unknown[pt][pt] == 0) && 1 <= unknown-#length-unknown[pt]) && 1 <= unknown-#length-unknown[ps]) && 1 == \valid[nondetString2]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 14 error locations. SAFE Result, 72.9s OverallTime, 22 OverallIterations, 3 TraceHistogramMax, 60.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 222 SDtfs, 2870 SDslu, 1100 SDs, 0 SdLazy, 2727 SolverSat, 610 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 412 GetRequests, 155 SyntacticMatches, 4 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 61.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 378 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 12 NumberOfFragments, 524 HoareAnnotationTreeSize, 1 FomulaSimplifications, 7524 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 16335 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 448 ConstructedInterpolants, 51 QuantifiedInterpolants, 132591 SizeOfPredicates, 69 NumberOfNonLiveVariables, 915 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 29 InterpolantComputations, 18 PerfectInterpolantSequences, 56/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * pt + unknown-#length-unknown[alloca(length2 * sizeof(char))] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 75 SDslu, 71 SDs, 0 SdLazy, 140 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital214 mio100 ax100 hnf100 lsp97 ukn84 mio100 lsp45 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 08:51:53.040 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 08:53:12.635 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check