./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array12_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array12_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b994a1ec31b8c037535d8c99bc15e7231c0aea3fc6bbd2fe006bfaa61a5800c0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:09:46,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:09:46,413 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-12 02:09:46,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:09:46,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:09:46,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:09:46,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:09:46,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:09:46,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:09:46,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:09:46,473 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:09:46,474 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-12 02:09:46,474 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-12 02:09:46,476 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-12 02:09:46,477 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-12 02:09:46,477 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-12 02:09:46,478 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-12 02:09:46,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:09:46,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-12 02:09:46,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:09:46,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:09:46,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-12 02:09:46,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-12 02:09:46,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-12 02:09:46,482 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:09:46,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:09:46,483 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-12 02:09:46,483 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:09:46,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:09:46,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:09:46,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:09:46,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:09:46,487 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-12 02:09:46,487 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b994a1ec31b8c037535d8c99bc15e7231c0aea3fc6bbd2fe006bfaa61a5800c0 [2023-11-12 02:09:46,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:09:46,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:09:46,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:09:46,821 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:09:46,821 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:09:46,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/termination-15/array12_alloca.i [2023-11-12 02:09:49,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:09:50,228 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:09:50,228 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/sv-benchmarks/c/termination-15/array12_alloca.i [2023-11-12 02:09:50,243 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/data/14d710aac/26202dcf667049a0ab5da52e2ad09162/FLAGf7346af73 [2023-11-12 02:09:50,537 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/data/14d710aac/26202dcf667049a0ab5da52e2ad09162 [2023-11-12 02:09:50,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:09:50,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:09:50,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:09:50,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:09:50,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:09:50,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:09:50" (1/1) ... [2023-11-12 02:09:50,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@741dadc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:50, skipping insertion in model container [2023-11-12 02:09:50,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:09:50" (1/1) ... [2023-11-12 02:09:50,597 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:09:50,914 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:09:50,930 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:09:51,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:09:51,060 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:09:51,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:51 WrapperNode [2023-11-12 02:09:51,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:09:51,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:09:51,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:09:51,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:09:51,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:51" (1/1) ... [2023-11-12 02:09:51,100 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:51" (1/1) ... [2023-11-12 02:09:51,131 INFO L138 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-11-12 02:09:51,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:09:51,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:09:51,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:09:51,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:09:51,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:51" (1/1) ... [2023-11-12 02:09:51,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:51" (1/1) ... [2023-11-12 02:09:51,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:51" (1/1) ... [2023-11-12 02:09:51,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:51" (1/1) ... [2023-11-12 02:09:51,167 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:51" (1/1) ... [2023-11-12 02:09:51,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:51" (1/1) ... [2023-11-12 02:09:51,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:51" (1/1) ... [2023-11-12 02:09:51,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:51" (1/1) ... [2023-11-12 02:09:51,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:09:51,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:09:51,192 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:09:51,192 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:09:51,194 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:51" (1/1) ... [2023-11-12 02:09:51,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:51,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:51,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:51,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-12 02:09:51,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:09:51,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:09:51,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:09:51,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:09:51,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:09:51,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:09:51,416 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:09:51,420 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:09:51,588 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:09:51,595 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:09:51,596 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 02:09:51,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:09:51 BoogieIcfgContainer [2023-11-12 02:09:51,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:09:51,599 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-12 02:09:51,600 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-12 02:09:51,604 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-12 02:09:51,605 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:09:51,606 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.11 02:09:50" (1/3) ... [2023-11-12 02:09:51,607 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@751f31fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 02:09:51, skipping insertion in model container [2023-11-12 02:09:51,607 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:09:51,607 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:09:51" (2/3) ... [2023-11-12 02:09:51,608 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@751f31fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.11 02:09:51, skipping insertion in model container [2023-11-12 02:09:51,608 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-12 02:09:51,608 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:09:51" (3/3) ... [2023-11-12 02:09:51,610 INFO L332 chiAutomizerObserver]: Analyzing ICFG array12_alloca.i [2023-11-12 02:09:51,673 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-12 02:09:51,673 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-12 02:09:51,673 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-12 02:09:51,673 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-12 02:09:51,674 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-12 02:09:51,674 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-12 02:09:51,674 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-12 02:09:51,674 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-12 02:09:51,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:51,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-12 02:09:51,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:09:51,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:09:51,713 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-12 02:09:51,714 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-12 02:09:51,715 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-12 02:09:51,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:51,719 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2023-11-12 02:09:51,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:09:51,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:09:51,723 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-11-12 02:09:51,724 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-12 02:09:51,734 INFO L748 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 6#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 4#L370-3true [2023-11-12 02:09:51,734 INFO L750 eck$LassoCheckResult]: Loop: 4#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 12#L372true assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 15#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 4#L370-3true [2023-11-12 02:09:51,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2023-11-12 02:09:51,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:51,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627917602] [2023-11-12 02:09:51,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:51,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:51,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:51,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:51,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:51,909 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2023-11-12 02:09:51,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122782559] [2023-11-12 02:09:51,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:51,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:51,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:51,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2023-11-12 02:09:51,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:51,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648333421] [2023-11-12 02:09:51,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:51,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:52,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:52,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:52,500 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:09:52,501 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:09:52,501 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:09:52,501 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:09:52,502 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-12 02:09:52,502 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:52,502 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:09:52,502 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:09:52,503 INFO L133 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration1_Lasso [2023-11-12 02:09:52,503 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:09:52,503 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:09:52,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:09:52,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:09:52,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:09:52,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:09:52,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:09:52,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:09:52,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:09:52,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:09:52,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:09:52,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:09:52,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:09:53,040 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:09:53,045 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-12 02:09:53,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:53,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:53,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:53,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:09:53,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-12 02:09:53,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:09:53,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:09:53,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:09:53,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:09:53,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:09:53,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:09:53,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:09:53,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:09:53,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:53,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:53,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:53,123 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:53,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-12 02:09:53,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:09:53,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:09:53,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:09:53,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:09:53,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:09:53,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:09:53,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:09:53,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:09:53,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:53,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:53,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:53,178 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:53,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-12 02:09:53,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:09:53,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:09:53,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:09:53,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:09:53,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:09:53,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:09:53,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:09:53,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:09:53,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:09:53,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:53,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:53,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:53,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-12 02:09:53,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:09:53,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:09:53,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:09:53,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:09:53,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:09:53,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:09:53,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:09:53,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:09:53,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:09:53,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:53,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:53,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:53,269 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:53,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:09:53,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-12 02:09:53,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:09:53,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:09:53,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:09:53,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:09:53,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:09:53,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:09:53,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:09:53,309 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:09:53,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:53,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:53,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:53,322 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:53,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-12 02:09:53,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:09:53,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:09:53,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:09:53,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:09:53,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:09:53,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:09:53,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:09:53,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:09:53,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:09:53,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:53,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:53,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:53,362 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:53,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-12 02:09:53,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:09:53,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:09:53,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:09:53,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:09:53,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:09:53,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:09:53,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:09:53,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:09:53,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:09:53,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:53,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:53,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:53,409 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:53,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-12 02:09:53,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:09:53,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:09:53,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:09:53,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:09:53,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:09:53,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:09:53,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:09:53,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:09:53,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:09:53,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:53,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:53,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:53,452 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:53,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-12 02:09:53,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:09:53,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:09:53,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:09:53,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:09:53,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:09:53,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:09:53,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:09:53,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:09:53,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:53,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:53,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:53,528 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:53,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:09:53,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-12 02:09:53,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:09:53,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:09:53,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:09:53,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:09:53,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:09:53,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:09:53,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:09:53,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:09:53,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:53,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:53,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:53,585 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:53,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:09:53,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-12 02:09:53,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:09:53,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:09:53,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:09:53,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:09:53,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:09:53,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:09:53,624 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:09:53,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:53,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:53,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:53,631 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:53,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:09:53,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-12 02:09:53,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:09:53,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:09:53,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:09:53,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:09:53,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:09:53,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:09:53,677 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-12 02:09:53,720 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-11-12 02:09:53,720 INFO L444 ModelExtractionUtils]: 1 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2023-11-12 02:09:53,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:09:53,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:53,742 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:09:53,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-12 02:09:53,764 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-12 02:09:53,806 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-12 02:09:53,807 INFO L513 LassoAnalysis]: Proved termination. [2023-11-12 02:09:53,807 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 2*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 4*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-11-12 02:09:53,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:53,853 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-11-12 02:09:53,866 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~arr~0!base] could not be translated [2023-11-12 02:09:53,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:53,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-12 02:09:53,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:53,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 02:09:53,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:54,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:54,102 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-12 02:09:54,105 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:54,201 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 33 states and 48 transitions. Complement of second has 8 states. [2023-11-12 02:09:54,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-12 02:09:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2023-11-12 02:09:54,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 5 letters. Loop has 3 letters. [2023-11-12 02:09:54,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:09:54,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 8 letters. Loop has 3 letters. [2023-11-12 02:09:54,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:09:54,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 5 letters. Loop has 6 letters. [2023-11-12 02:09:54,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:09:54,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 48 transitions. [2023-11-12 02:09:54,219 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:09:54,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 12 states and 17 transitions. [2023-11-12 02:09:54,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-11-12 02:09:54,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-11-12 02:09:54,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2023-11-12 02:09:54,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:09:54,226 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-12 02:09:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2023-11-12 02:09:54,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-12 02:09:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2023-11-12 02:09:54,255 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-12 02:09:54,255 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2023-11-12 02:09:54,256 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-12 02:09:54,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2023-11-12 02:09:54,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:09:54,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:09:54,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:09:54,257 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:54,257 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:09:54,258 INFO L748 eck$LassoCheckResult]: Stem: 117#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 118#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 119#L367 assume !(main_~length~0#1 < 1); 111#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 112#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 113#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 114#L370-4 main_~j~0#1 := 0; 115#L378-2 [2023-11-12 02:09:54,258 INFO L750 eck$LassoCheckResult]: Loop: 115#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 116#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 115#L378-2 [2023-11-12 02:09:54,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:54,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2023-11-12 02:09:54,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:54,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002422433] [2023-11-12 02:09:54,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:54,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:54,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:54,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002422433] [2023-11-12 02:09:54,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002422433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:54,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:09:54,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:09:54,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650874687] [2023-11-12 02:09:54,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:54,356 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:09:54,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:54,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2023-11-12 02:09:54,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:54,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337237659] [2023-11-12 02:09:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:54,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:54,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:54,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:54,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:54,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:09:54,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:09:54,452 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:54,484 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2023-11-12 02:09:54,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2023-11-12 02:09:54,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:09:54,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2023-11-12 02:09:54,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-11-12 02:09:54,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-11-12 02:09:54,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2023-11-12 02:09:54,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:09:54,487 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2023-11-12 02:09:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2023-11-12 02:09:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2023-11-12 02:09:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2023-11-12 02:09:54,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-12 02:09:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:09:54,491 INFO L428 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-11-12 02:09:54,491 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-12 02:09:54,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2023-11-12 02:09:54,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:09:54,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:09:54,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:09:54,493 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:54,493 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:09:54,494 INFO L748 eck$LassoCheckResult]: Stem: 150#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 152#L367 assume !(main_~length~0#1 < 1); 144#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 145#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 146#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 153#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 155#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 154#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 147#L370-4 main_~j~0#1 := 0; 148#L378-2 [2023-11-12 02:09:54,494 INFO L750 eck$LassoCheckResult]: Loop: 148#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 149#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 148#L378-2 [2023-11-12 02:09:54,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:54,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2023-11-12 02:09:54,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:54,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597917074] [2023-11-12 02:09:54,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:54,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:54,517 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:54,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:54,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:54,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2023-11-12 02:09:54,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:54,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829060590] [2023-11-12 02:09:54,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:54,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:54,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:54,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2023-11-12 02:09:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:54,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519757119] [2023-11-12 02:09:54,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:55,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:55,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519757119] [2023-11-12 02:09:55,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519757119] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:55,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792926468] [2023-11-12 02:09:55,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:55,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:55,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:55,061 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:55,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-12 02:09:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:55,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-12 02:09:55,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:55,197 INFO L351 Elim1Store]: Elim1 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 1 [2023-11-12 02:09:55,268 INFO L351 Elim1Store]: Elim1 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 [2023-11-12 02:09:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:55,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:55,354 INFO L351 Elim1Store]: Elim1 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 16 treesize of output 14 [2023-11-12 02:09:55,360 INFO L351 Elim1Store]: Elim1 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 22 treesize of output 20 [2023-11-12 02:09:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:55,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792926468] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:09:55,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:09:55,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2023-11-12 02:09:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799009910] [2023-11-12 02:09:55,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:09:55,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:55,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 02:09:55,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-11-12 02:09:55,450 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:55,632 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2023-11-12 02:09:55,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2023-11-12 02:09:55,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-12 02:09:55,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2023-11-12 02:09:55,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-12 02:09:55,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-12 02:09:55,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2023-11-12 02:09:55,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:09:55,642 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2023-11-12 02:09:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2023-11-12 02:09:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2023-11-12 02:09:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2023-11-12 02:09:55,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2023-11-12 02:09:55,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:09:55,653 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2023-11-12 02:09:55,653 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-12 02:09:55,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2023-11-12 02:09:55,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:09:55,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:09:55,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:09:55,659 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:55,659 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:09:55,659 INFO L748 eck$LassoCheckResult]: Stem: 274#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 276#L367 assume !(main_~length~0#1 < 1); 268#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 269#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 270#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 277#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 282#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 278#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 279#L370-4 main_~j~0#1 := 0; 281#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 271#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 272#L378-2 [2023-11-12 02:09:55,660 INFO L750 eck$LassoCheckResult]: Loop: 272#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 283#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 272#L378-2 [2023-11-12 02:09:55,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:55,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2023-11-12 02:09:55,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:55,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442341528] [2023-11-12 02:09:55,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:55,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:55,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:55,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:55,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:55,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2023-11-12 02:09:55,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:55,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551660648] [2023-11-12 02:09:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:55,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:55,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:55,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:55,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:55,723 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2023-11-12 02:09:55,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:55,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262128932] [2023-11-12 02:09:55,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:55,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:55,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:55,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262128932] [2023-11-12 02:09:55,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262128932] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:55,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158335660] [2023-11-12 02:09:55,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:55,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:55,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:55,855 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:55,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-12 02:09:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:55,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 02:09:55,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:55,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:55,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:56,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158335660] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:09:56,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:09:56,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-12 02:09:56,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749879836] [2023-11-12 02:09:56,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:09:56,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:56,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:09:56,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:09:56,135 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:56,296 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2023-11-12 02:09:56,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2023-11-12 02:09:56,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-12 02:09:56,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 39 states and 51 transitions. [2023-11-12 02:09:56,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-11-12 02:09:56,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-11-12 02:09:56,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2023-11-12 02:09:56,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:09:56,301 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-12 02:09:56,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2023-11-12 02:09:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2023-11-12 02:09:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2023-11-12 02:09:56,307 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-12 02:09:56,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 02:09:56,308 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-11-12 02:09:56,309 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-12 02:09:56,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2023-11-12 02:09:56,310 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-12 02:09:56,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:09:56,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:09:56,311 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:56,311 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:09:56,312 INFO L748 eck$LassoCheckResult]: Stem: 441#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 442#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 443#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 434#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 435#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 436#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 466#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 464#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 465#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 463#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 461#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 458#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 437#L370-4 main_~j~0#1 := 0; 438#L378-2 [2023-11-12 02:09:56,312 INFO L750 eck$LassoCheckResult]: Loop: 438#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 450#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 438#L378-2 [2023-11-12 02:09:56,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:56,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2023-11-12 02:09:56,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:56,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291475608] [2023-11-12 02:09:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:56,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:56,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:56,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291475608] [2023-11-12 02:09:56,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291475608] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:56,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370868306] [2023-11-12 02:09:56,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:56,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:56,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:56,410 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:56,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-12 02:09:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:56,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:09:56,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:56,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:09:56,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370868306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:09:56,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 02:09:56,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-12 02:09:56,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990128033] [2023-11-12 02:09:56,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:09:56,543 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:09:56,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:56,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2023-11-12 02:09:56,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:56,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535298740] [2023-11-12 02:09:56,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:56,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:56,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:56,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:56,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:56,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:09:56,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:09:56,616 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:56,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:56,651 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2023-11-12 02:09:56,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2023-11-12 02:09:56,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:09:56,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2023-11-12 02:09:56,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-11-12 02:09:56,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-11-12 02:09:56,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2023-11-12 02:09:56,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:09:56,654 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-11-12 02:09:56,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2023-11-12 02:09:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-12 02:09:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2023-11-12 02:09:56,657 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-11-12 02:09:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:09:56,658 INFO L428 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2023-11-12 02:09:56,659 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-12 02:09:56,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2023-11-12 02:09:56,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:09:56,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:09:56,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:09:56,660 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:56,660 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:09:56,661 INFO L748 eck$LassoCheckResult]: Stem: 547#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 548#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 549#L367 assume !(main_~length~0#1 < 1); 541#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 542#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 543#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 550#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 553#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 551#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 552#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 560#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 557#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 544#L370-4 main_~j~0#1 := 0; 545#L378-2 [2023-11-12 02:09:56,661 INFO L750 eck$LassoCheckResult]: Loop: 545#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 554#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 545#L378-2 [2023-11-12 02:09:56,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:56,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2023-11-12 02:09:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:56,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721871275] [2023-11-12 02:09:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:56,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:56,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:56,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:56,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2023-11-12 02:09:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:56,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758598150] [2023-11-12 02:09:56,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:56,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:56,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:56,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:56,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:56,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2023-11-12 02:09:56,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:56,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255439800] [2023-11-12 02:09:56,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:56,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:57,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:57,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255439800] [2023-11-12 02:09:57,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255439800] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:57,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152995013] [2023-11-12 02:09:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:57,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:57,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:57,111 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:57,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-12 02:09:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:57,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-12 02:09:57,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:57,204 INFO L351 Elim1Store]: Elim1 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 1 [2023-11-12 02:09:57,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:57,270 INFO L351 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-12 02:09:57,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:57,294 INFO L351 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-12 02:09:57,319 INFO L351 Elim1Store]: Elim1 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 [2023-11-12 02:09:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:57,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:57,531 INFO L351 Elim1Store]: Elim1 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 23 treesize of output 21 [2023-11-12 02:09:57,537 INFO L351 Elim1Store]: Elim1 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 52 treesize of output 50 [2023-11-12 02:09:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:57,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152995013] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:09:57,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:09:57,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2023-11-12 02:09:57,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740914347] [2023-11-12 02:09:57,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:09:57,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:57,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-12 02:09:57,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2023-11-12 02:09:57,653 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:57,805 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2023-11-12 02:09:57,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2023-11-12 02:09:57,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:09:57,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 29 transitions. [2023-11-12 02:09:57,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-12 02:09:57,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-12 02:09:57,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2023-11-12 02:09:57,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:09:57,807 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 29 transitions. [2023-11-12 02:09:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2023-11-12 02:09:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2023-11-12 02:09:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-11-12 02:09:57,809 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-12 02:09:57,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:09:57,810 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-11-12 02:09:57,811 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-12 02:09:57,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2023-11-12 02:09:57,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:09:57,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:09:57,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:09:57,812 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:57,812 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:09:57,812 INFO L748 eck$LassoCheckResult]: Stem: 705#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 706#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 704#L367 assume !(main_~length~0#1 < 1); 697#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 698#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 699#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 707#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 712#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 708#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 709#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 710#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 711#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 700#L370-4 main_~j~0#1 := 0; 701#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 702#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 703#L378-2 [2023-11-12 02:09:57,812 INFO L750 eck$LassoCheckResult]: Loop: 703#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 713#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 703#L378-2 [2023-11-12 02:09:57,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:57,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2023-11-12 02:09:57,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:57,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640461392] [2023-11-12 02:09:57,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:57,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:57,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:57,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:57,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:57,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2023-11-12 02:09:57,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:57,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152986709] [2023-11-12 02:09:57,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:57,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:57,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:57,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:57,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:57,857 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2023-11-12 02:09:57,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:57,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596706282] [2023-11-12 02:09:57,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:57,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:58,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:58,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596706282] [2023-11-12 02:09:58,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596706282] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:58,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269642904] [2023-11-12 02:09:58,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:09:58,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:58,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:58,032 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:58,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-12 02:09:58,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:09:58,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:09:58,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-12 02:09:58,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:58,177 INFO L351 Elim1Store]: Elim1 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 1 [2023-11-12 02:09:58,307 INFO L351 Elim1Store]: Elim1 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 [2023-11-12 02:09:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:58,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:58,399 INFO L351 Elim1Store]: Elim1 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 18 treesize of output 16 [2023-11-12 02:09:58,402 INFO L351 Elim1Store]: Elim1 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 24 treesize of output 20 [2023-11-12 02:09:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:58,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269642904] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:09:58,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:09:58,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 18 [2023-11-12 02:09:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575861376] [2023-11-12 02:09:58,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:09:58,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:58,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-12 02:09:58,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2023-11-12 02:09:58,493 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:58,680 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2023-11-12 02:09:58,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2023-11-12 02:09:58,681 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-12 02:09:58,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2023-11-12 02:09:58,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2023-11-12 02:09:58,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-11-12 02:09:58,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2023-11-12 02:09:58,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:09:58,682 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-12 02:09:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2023-11-12 02:09:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2023-11-12 02:09:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-12 02:09:58,685 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-12 02:09:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:09:58,686 INFO L428 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-12 02:09:58,687 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-12 02:09:58,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2023-11-12 02:09:58,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:09:58,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:09:58,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:09:58,688 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:58,688 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:09:58,688 INFO L748 eck$LassoCheckResult]: Stem: 877#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 878#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 879#L367 assume !(main_~length~0#1 < 1); 871#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 872#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 873#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 880#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 888#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 881#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 882#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 883#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 885#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 886#L370-4 main_~j~0#1 := 0; 891#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 876#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 875#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 884#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 890#L378-2 [2023-11-12 02:09:58,688 INFO L750 eck$LassoCheckResult]: Loop: 890#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 889#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 890#L378-2 [2023-11-12 02:09:58,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:58,689 INFO L85 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2023-11-12 02:09:58,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:58,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106271886] [2023-11-12 02:09:58,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:58,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:58,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:58,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:58,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2023-11-12 02:09:58,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:58,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968871131] [2023-11-12 02:09:58,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:58,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:58,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:58,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:58,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:58,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2023-11-12 02:09:58,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:58,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519844068] [2023-11-12 02:09:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:58,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:58,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519844068] [2023-11-12 02:09:58,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519844068] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:58,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652772311] [2023-11-12 02:09:58,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 02:09:58,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:58,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:58,926 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:58,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-12 02:09:59,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-12 02:09:59,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:09:59,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 02:09:59,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:59,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:59,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652772311] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:09:59,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:09:59,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-12 02:09:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575761610] [2023-11-12 02:09:59,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:09:59,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:59,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 02:09:59,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:09:59,219 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 10 Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:59,333 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2023-11-12 02:09:59,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2023-11-12 02:09:59,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:09:59,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 37 transitions. [2023-11-12 02:09:59,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-12 02:09:59,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-11-12 02:09:59,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2023-11-12 02:09:59,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:09:59,338 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2023-11-12 02:09:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2023-11-12 02:09:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2023-11-12 02:09:59,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:09:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-11-12 02:09:59,344 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-11-12 02:09:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:09:59,346 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-11-12 02:09:59,347 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-12 02:09:59,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2023-11-12 02:09:59,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:09:59,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:09:59,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:09:59,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:59,350 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:09:59,350 INFO L748 eck$LassoCheckResult]: Stem: 1073#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1074#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1072#L367 assume !(main_~length~0#1 < 1); 1065#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1066#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1067#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1075#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1078#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1079#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1089#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1090#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1076#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1077#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1088#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1080#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1081#L370-4 main_~j~0#1 := 0; 1071#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1087#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1086#L378-2 [2023-11-12 02:09:59,350 INFO L750 eck$LassoCheckResult]: Loop: 1086#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1085#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1086#L378-2 [2023-11-12 02:09:59,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:59,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1742222883, now seen corresponding path program 1 times [2023-11-12 02:09:59,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:59,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837832555] [2023-11-12 02:09:59,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:59,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:59,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:59,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:59,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:59,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2023-11-12 02:09:59,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:59,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882141699] [2023-11-12 02:09:59,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:59,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:09:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:09:59,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:09:59,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash -761053530, now seen corresponding path program 1 times [2023-11-12 02:09:59,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:59,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170377724] [2023-11-12 02:09:59,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:59,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:59,774 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:09:59,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:59,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170377724] [2023-11-12 02:09:59,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170377724] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:59,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547565442] [2023-11-12 02:09:59,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:59,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:59,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:59,782 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:59,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-12 02:09:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:59,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-12 02:09:59,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:59,965 INFO L351 Elim1Store]: Elim1 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 1 [2023-11-12 02:10:00,074 INFO L351 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-11-12 02:10:00,089 INFO L351 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-11-12 02:10:00,197 INFO L351 Elim1Store]: Elim1 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 [2023-11-12 02:10:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:00,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:10:00,371 INFO L351 Elim1Store]: Elim1 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 21 treesize of output 19 [2023-11-12 02:10:00,375 INFO L351 Elim1Store]: Elim1 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 25 treesize of output 21 [2023-11-12 02:10:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:00,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547565442] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:10:00,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:10:00,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2023-11-12 02:10:00,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344135696] [2023-11-12 02:10:00,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:10:00,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:00,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-12 02:10:00,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2023-11-12 02:10:00,447 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 10 Second operand has 23 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 23 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:00,857 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2023-11-12 02:10:00,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 100 transitions. [2023-11-12 02:10:00,859 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-12 02:10:00,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 100 transitions. [2023-11-12 02:10:00,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2023-11-12 02:10:00,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2023-11-12 02:10:00,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 100 transitions. [2023-11-12 02:10:00,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:10:00,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 100 transitions. [2023-11-12 02:10:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 100 transitions. [2023-11-12 02:10:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 41. [2023-11-12 02:10:00,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 40 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2023-11-12 02:10:00,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 58 transitions. [2023-11-12 02:10:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-12 02:10:00,869 INFO L428 stractBuchiCegarLoop]: Abstraction has 41 states and 58 transitions. [2023-11-12 02:10:00,869 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-12 02:10:00,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 58 transitions. [2023-11-12 02:10:00,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:10:00,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:10:00,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:10:00,871 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:00,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:10:00,872 INFO L748 eck$LassoCheckResult]: Stem: 1338#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1339#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1340#L367 assume !(main_~length~0#1 < 1); 1332#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1333#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1334#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1341#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1347#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1348#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1354#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1355#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1342#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1343#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1345#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1372#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1350#L370-4 main_~j~0#1 := 0; 1358#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1335#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1336#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1344#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1357#L378-2 [2023-11-12 02:10:00,872 INFO L750 eck$LassoCheckResult]: Loop: 1357#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1356#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1357#L378-2 [2023-11-12 02:10:00,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash -761053528, now seen corresponding path program 2 times [2023-11-12 02:10:00,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:00,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585105989] [2023-11-12 02:10:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:00,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:00,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:00,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2023-11-12 02:10:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:00,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602574334] [2023-11-12 02:10:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:00,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:00,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:00,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:00,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1227998741, now seen corresponding path program 2 times [2023-11-12 02:10:00,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:00,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551552852] [2023-11-12 02:10:00,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:00,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:01,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:01,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551552852] [2023-11-12 02:10:01,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551552852] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:10:01,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359249261] [2023-11-12 02:10:01,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:10:01,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:01,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:01,215 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:10:01,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-12 02:10:01,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:10:01,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:10:01,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-12 02:10:01,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:01,413 INFO L351 Elim1Store]: Elim1 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 1 [2023-11-12 02:10:01,574 INFO L351 Elim1Store]: Elim1 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 [2023-11-12 02:10:01,596 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:01,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:10:01,735 INFO L351 Elim1Store]: Elim1 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 18 treesize of output 16 [2023-11-12 02:10:01,739 INFO L351 Elim1Store]: Elim1 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 24 treesize of output 20 [2023-11-12 02:10:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359249261] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:10:01,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:10:01,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2023-11-12 02:10:01,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651113265] [2023-11-12 02:10:01,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:10:01,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:01,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-12 02:10:01,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2023-11-12 02:10:01,826 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. cyclomatic complexity: 20 Second operand has 24 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:02,201 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2023-11-12 02:10:02,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 68 transitions. [2023-11-12 02:10:02,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-11-12 02:10:02,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 68 transitions. [2023-11-12 02:10:02,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-11-12 02:10:02,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-11-12 02:10:02,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 68 transitions. [2023-11-12 02:10:02,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:10:02,204 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 68 transitions. [2023-11-12 02:10:02,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 68 transitions. [2023-11-12 02:10:02,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2023-11-12 02:10:02,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 43 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2023-11-12 02:10:02,207 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 61 transitions. [2023-11-12 02:10:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 02:10:02,209 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 61 transitions. [2023-11-12 02:10:02,209 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-12 02:10:02,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 61 transitions. [2023-11-12 02:10:02,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-12 02:10:02,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:10:02,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:10:02,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:02,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:10:02,211 INFO L748 eck$LassoCheckResult]: Stem: 1596#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1597#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1598#L367 assume !(main_~length~0#1 < 1); 1590#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1591#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1592#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1599#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1610#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1611#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1612#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1613#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1600#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1601#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1603#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1633#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1593#L370-4 main_~j~0#1 := 0; 1594#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1617#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1615#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1614#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1609#L378-2 [2023-11-12 02:10:02,211 INFO L750 eck$LassoCheckResult]: Loop: 1609#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1608#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1609#L378-2 [2023-11-12 02:10:02,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1570400154, now seen corresponding path program 4 times [2023-11-12 02:10:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:02,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022840119] [2023-11-12 02:10:02,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:02,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:02,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:02,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:02,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2023-11-12 02:10:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:02,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481914597] [2023-11-12 02:10:02,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:02,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:02,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:02,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:02,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1621025751, now seen corresponding path program 4 times [2023-11-12 02:10:02,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:02,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098727998] [2023-11-12 02:10:02,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:02,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:02,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:02,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098727998] [2023-11-12 02:10:02,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098727998] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:10:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943928766] [2023-11-12 02:10:02,606 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 02:10:02,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:02,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:02,610 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:10:02,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-12 02:10:02,700 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 02:10:02,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:10:02,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-12 02:10:02,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:02,736 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-12 02:10:02,821 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-11-12 02:10:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:02,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:10:02,925 INFO L351 Elim1Store]: Elim1 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 18 treesize of output 16 [2023-11-12 02:10:02,929 INFO L351 Elim1Store]: Elim1 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 24 treesize of output 20 [2023-11-12 02:10:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:02,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943928766] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:10:02,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:10:02,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2023-11-12 02:10:02,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432121302] [2023-11-12 02:10:02,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:10:03,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:03,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 02:10:03,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-11-12 02:10:03,003 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. cyclomatic complexity: 20 Second operand has 17 states, 16 states have (on average 2.125) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:03,230 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2023-11-12 02:10:03,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 97 transitions. [2023-11-12 02:10:03,231 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2023-11-12 02:10:03,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 97 transitions. [2023-11-12 02:10:03,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-12 02:10:03,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-12 02:10:03,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 97 transitions. [2023-11-12 02:10:03,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:10:03,233 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 97 transitions. [2023-11-12 02:10:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 97 transitions. [2023-11-12 02:10:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2023-11-12 02:10:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 58 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2023-11-12 02:10:03,237 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 83 transitions. [2023-11-12 02:10:03,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 02:10:03,240 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 83 transitions. [2023-11-12 02:10:03,241 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-12 02:10:03,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 83 transitions. [2023-11-12 02:10:03,241 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:10:03,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:10:03,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:10:03,243 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:03,243 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:10:03,245 INFO L748 eck$LassoCheckResult]: Stem: 1862#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1863#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1864#L367 assume !(main_~length~0#1 < 1); 1856#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1857#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1858#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1865#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1875#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1876#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1877#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 1878#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1866#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1867#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1902#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1901#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1874#L370-4 main_~j~0#1 := 0; 1908#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1861#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1860#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1871#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1881#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1884#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1882#L378-2 [2023-11-12 02:10:03,245 INFO L750 eck$LassoCheckResult]: Loop: 1882#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1883#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1882#L378-2 [2023-11-12 02:10:03,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:03,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1227998739, now seen corresponding path program 3 times [2023-11-12 02:10:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:03,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418910036] [2023-11-12 02:10:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:03,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:03,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:03,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:03,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:03,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2023-11-12 02:10:03,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:03,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606945103] [2023-11-12 02:10:03,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:03,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:03,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:03,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:03,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1009219568, now seen corresponding path program 3 times [2023-11-12 02:10:03,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:03,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848663213] [2023-11-12 02:10:03,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:03,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:03,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:03,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848663213] [2023-11-12 02:10:03,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848663213] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:10:03,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370055165] [2023-11-12 02:10:03,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 02:10:03,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:03,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:03,455 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:10:03,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-12 02:10:03,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-12 02:10:03,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:10:03,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-12 02:10:03,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:03,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:10:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370055165] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:10:03,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:10:03,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-12 02:10:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393855571] [2023-11-12 02:10:03,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:10:03,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:03,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-12 02:10:03,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2023-11-12 02:10:03,797 INFO L87 Difference]: Start difference. First operand 59 states and 83 transitions. cyclomatic complexity: 29 Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:03,925 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2023-11-12 02:10:03,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 90 transitions. [2023-11-12 02:10:03,926 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:10:03,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 59 states and 81 transitions. [2023-11-12 02:10:03,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-11-12 02:10:03,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-11-12 02:10:03,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 81 transitions. [2023-11-12 02:10:03,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:10:03,928 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2023-11-12 02:10:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 81 transitions. [2023-11-12 02:10:03,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-12 02:10:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 58 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2023-11-12 02:10:03,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2023-11-12 02:10:03,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:10:03,934 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 81 transitions. [2023-11-12 02:10:03,934 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-12 02:10:03,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 81 transitions. [2023-11-12 02:10:03,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:10:03,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:10:03,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:10:03,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:03,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:10:03,937 INFO L748 eck$LassoCheckResult]: Stem: 2158#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2159#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2160#L367 assume !(main_~length~0#1 < 1); 2152#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2153#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2154#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2161#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2164#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2162#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2163#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2210#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2209#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2208#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2207#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2199#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2196#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2197#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2166#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2155#L370-4 main_~j~0#1 := 0; 2156#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2165#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2170#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2172#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2173#L378-2 [2023-11-12 02:10:03,937 INFO L750 eck$LassoCheckResult]: Loop: 2173#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2174#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2173#L378-2 [2023-11-12 02:10:03,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash 775133344, now seen corresponding path program 4 times [2023-11-12 02:10:03,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:03,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206027581] [2023-11-12 02:10:03,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:03,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:03,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:03,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:03,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2023-11-12 02:10:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:03,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597465244] [2023-11-12 02:10:03,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:03,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:03,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:03,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:03,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:03,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1873802723, now seen corresponding path program 4 times [2023-11-12 02:10:03,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:03,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452690816] [2023-11-12 02:10:03,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:03,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:04,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:04,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452690816] [2023-11-12 02:10:04,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452690816] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:10:04,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951705206] [2023-11-12 02:10:04,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-12 02:10:04,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:04,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:04,413 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:10:04,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-12 02:10:04,507 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-12 02:10:04,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:10:04,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-12 02:10:04,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:04,536 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 1 [2023-11-12 02:10:04,586 INFO L322 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-12 02:10:04,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2023-11-12 02:10:04,608 INFO L322 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-12 02:10:04,610 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2023-11-12 02:10:04,712 INFO L351 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-11-12 02:10:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:04,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:10:06,310 INFO L351 Elim1Store]: Elim1 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 25 treesize of output 23 [2023-11-12 02:10:06,325 INFO L351 Elim1Store]: Elim1 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 54 treesize of output 50 [2023-11-12 02:10:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:06,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951705206] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:10:06,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:10:06,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2023-11-12 02:10:06,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800629971] [2023-11-12 02:10:06,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:10:06,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:06,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-12 02:10:06,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2023-11-12 02:10:06,429 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. cyclomatic complexity: 27 Second operand has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:06,839 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2023-11-12 02:10:06,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 120 transitions. [2023-11-12 02:10:06,840 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2023-11-12 02:10:06,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 120 transitions. [2023-11-12 02:10:06,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2023-11-12 02:10:06,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2023-11-12 02:10:06,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 120 transitions. [2023-11-12 02:10:06,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:10:06,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 120 transitions. [2023-11-12 02:10:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 120 transitions. [2023-11-12 02:10:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2023-11-12 02:10:06,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 58 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:06,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2023-11-12 02:10:06,846 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 81 transitions. [2023-11-12 02:10:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 02:10:06,854 INFO L428 stractBuchiCegarLoop]: Abstraction has 59 states and 81 transitions. [2023-11-12 02:10:06,855 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-12 02:10:06,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 81 transitions. [2023-11-12 02:10:06,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:10:06,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:10:06,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:10:06,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:06,858 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:10:06,860 INFO L748 eck$LassoCheckResult]: Stem: 2491#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2492#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2493#L367 assume !(main_~length~0#1 < 1); 2484#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2485#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2486#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2494#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2510#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2505#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2504#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2499#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2500#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2508#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2509#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2495#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2496#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2497#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2501#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2502#L370-4 main_~j~0#1 := 0; 2488#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2532#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2513#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2516#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2514#L378-2 [2023-11-12 02:10:06,860 INFO L750 eck$LassoCheckResult]: Loop: 2514#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2515#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2514#L378-2 [2023-11-12 02:10:06,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:06,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1476197922, now seen corresponding path program 5 times [2023-11-12 02:10:06,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:06,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123426386] [2023-11-12 02:10:06,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:06,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:06,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:06,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:06,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 13 times [2023-11-12 02:10:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:06,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375142144] [2023-11-12 02:10:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:06,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:06,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:06,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:06,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:06,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1286996709, now seen corresponding path program 5 times [2023-11-12 02:10:06,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:06,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862356440] [2023-11-12 02:10:06,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:06,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:07,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:07,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862356440] [2023-11-12 02:10:07,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862356440] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:10:07,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054758345] [2023-11-12 02:10:07,385 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-12 02:10:07,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:07,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:07,389 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:10:07,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-12 02:10:07,503 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-12 02:10:07,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:10:07,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-12 02:10:07,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:07,622 INFO L351 Elim1Store]: Elim1 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 1 [2023-11-12 02:10:07,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:10:07,728 INFO L351 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-12 02:10:07,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:10:07,743 INFO L351 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-12 02:10:07,935 INFO L351 Elim1Store]: Elim1 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 [2023-11-12 02:10:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:07,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:10:08,162 INFO L351 Elim1Store]: Elim1 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 20 treesize of output 18 [2023-11-12 02:10:08,166 INFO L351 Elim1Store]: Elim1 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 24 treesize of output 20 [2023-11-12 02:10:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:08,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054758345] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:10:08,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:10:08,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 28 [2023-11-12 02:10:08,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758294006] [2023-11-12 02:10:08,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:10:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:08,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-12 02:10:08,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2023-11-12 02:10:08,240 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. cyclomatic complexity: 27 Second operand has 29 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 29 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:08,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:08,643 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2023-11-12 02:10:08,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2023-11-12 02:10:08,644 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-12 02:10:08,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 96 transitions. [2023-11-12 02:10:08,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-12 02:10:08,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-12 02:10:08,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 96 transitions. [2023-11-12 02:10:08,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:10:08,646 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 96 transitions. [2023-11-12 02:10:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 96 transitions. [2023-11-12 02:10:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2023-11-12 02:10:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.346938775510204) internal successors, (66), 48 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2023-11-12 02:10:08,650 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 66 transitions. [2023-11-12 02:10:08,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 02:10:08,660 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2023-11-12 02:10:08,661 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-11-12 02:10:08,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 66 transitions. [2023-11-12 02:10:08,662 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:10:08,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:10:08,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:10:08,663 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:08,665 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:10:08,665 INFO L748 eck$LassoCheckResult]: Stem: 2812#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2813#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2814#L367 assume !(main_~length~0#1 < 1); 2805#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2806#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2807#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2815#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2826#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2827#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2828#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2824#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2825#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2831#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2832#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2816#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2817#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 2853#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2844#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2808#L370-4 main_~j~0#1 := 0; 2809#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2810#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2811#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2842#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2835#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2837#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2838#L378-2 [2023-11-12 02:10:08,667 INFO L750 eck$LassoCheckResult]: Loop: 2838#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2839#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2838#L378-2 [2023-11-12 02:10:08,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:08,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1480775715, now seen corresponding path program 6 times [2023-11-12 02:10:08,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:08,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005890287] [2023-11-12 02:10:08,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:08,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:08,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:08,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:08,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 14 times [2023-11-12 02:10:08,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:08,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489586933] [2023-11-12 02:10:08,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:08,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:08,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:08,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:08,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:08,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1391288486, now seen corresponding path program 6 times [2023-11-12 02:10:08,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:08,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105669253] [2023-11-12 02:10:08,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:08,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:09,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:09,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105669253] [2023-11-12 02:10:09,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105669253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:10:09,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294793527] [2023-11-12 02:10:09,039 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-12 02:10:09,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:09,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:09,046 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:10:09,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-12 02:10:09,163 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-12 02:10:09,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:10:09,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-12 02:10:09,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:09,254 INFO L351 Elim1Store]: Elim1 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 23 treesize of output 1 [2023-11-12 02:10:09,693 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 02:10:09,694 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2023-11-12 02:10:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:09,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:10:10,366 INFO L351 Elim1Store]: Elim1 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 20 treesize of output 18 [2023-11-12 02:10:10,372 INFO L351 Elim1Store]: Elim1 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 26 treesize of output 20 [2023-11-12 02:10:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:10,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294793527] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:10:10,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:10:10,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2023-11-12 02:10:10,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58463664] [2023-11-12 02:10:10,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:10:10,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:10,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-12 02:10:10,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2023-11-12 02:10:10,530 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. cyclomatic complexity: 21 Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:14,663 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2023-11-12 02:10:14,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 76 transitions. [2023-11-12 02:10:14,664 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2023-11-12 02:10:14,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 60 states and 76 transitions. [2023-11-12 02:10:14,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-11-12 02:10:14,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2023-11-12 02:10:14,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 76 transitions. [2023-11-12 02:10:14,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:10:14,665 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 76 transitions. [2023-11-12 02:10:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 76 transitions. [2023-11-12 02:10:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2023-11-12 02:10:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2023-11-12 02:10:14,668 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 59 transitions. [2023-11-12 02:10:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-12 02:10:14,669 INFO L428 stractBuchiCegarLoop]: Abstraction has 43 states and 59 transitions. [2023-11-12 02:10:14,669 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-11-12 02:10:14,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 59 transitions. [2023-11-12 02:10:14,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:10:14,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:10:14,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:10:14,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:14,671 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:10:14,671 INFO L748 eck$LassoCheckResult]: Stem: 3164#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3165#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3166#L367 assume !(main_~length~0#1 < 1); 3158#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3159#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3160#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3167#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3184#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3179#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3178#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3173#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3174#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3182#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3183#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3168#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3169#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3171#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3175#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3161#L370-4 main_~j~0#1 := 0; 3162#L378-2 [2023-11-12 02:10:14,671 INFO L750 eck$LassoCheckResult]: Loop: 3162#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3163#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3162#L378-2 [2023-11-12 02:10:14,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1824010476, now seen corresponding path program 2 times [2023-11-12 02:10:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:14,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674573154] [2023-11-12 02:10:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:14,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:14,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:14,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:14,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2023-11-12 02:10:14,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:14,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58081283] [2023-11-12 02:10:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:14,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:14,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:14,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:14,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash -527409319, now seen corresponding path program 7 times [2023-11-12 02:10:14,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:14,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082530756] [2023-11-12 02:10:14,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:14,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:14,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:14,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:15,715 INFO L210 LassoAnalysis]: Preferences: [2023-11-12 02:10:15,716 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-12 02:10:15,716 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-12 02:10:15,716 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-12 02:10:15,716 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-12 02:10:15,716 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:10:15,716 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-12 02:10:15,716 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-12 02:10:15,716 INFO L133 ssoRankerPreferences]: Filename of dumped script: array12_alloca.i_Iteration16_Lasso [2023-11-12 02:10:15,716 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-12 02:10:15,716 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-12 02:10:15,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:10:15,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:10:15,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:10:15,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:10:15,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:10:15,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:10:15,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:10:15,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:10:15,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:10:15,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:10:15,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-12 02:10:16,233 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-12 02:10:16,233 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-12 02:10:16,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:10:16,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:16,238 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:10:16,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-12 02:10:16,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:10:16,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:10:16,262 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:10:16,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:10:16,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:10:16,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:10:16,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:10:16,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:10:16,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:10:16,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:16,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:10:16,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:16,283 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:10:16,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:10:16,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:10:16,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:10:16,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:10:16,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:10:16,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:10:16,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:10:16,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:10:16,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-12 02:10:16,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:10:16,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:16,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:10:16,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:16,340 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:10:16,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:10:16,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:10:16,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:10:16,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:10:16,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:10:16,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:10:16,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:10:16,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-12 02:10:16,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:10:16,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:16,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:10:16,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:16,388 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:10:16,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:10:16,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:10:16,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-12 02:10:16,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:10:16,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:10:16,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:10:16,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-12 02:10:16,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-12 02:10:16,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-12 02:10:16,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:10:16,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:16,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:10:16,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:16,432 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:10:16,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:10:16,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:10:16,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:10:16,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:10:16,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:10:16,451 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:10:16,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:10:16,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-12 02:10:16,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-12 02:10:16,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:16,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:10:16,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:16,481 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:10:16,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-12 02:10:16,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-12 02:10:16,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-12 02:10:16,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-12 02:10:16,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-12 02:10:16,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-12 02:10:16,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-12 02:10:16,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-12 02:10:16,529 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-12 02:10:16,555 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-11-12 02:10:16,555 INFO L444 ModelExtractionUtils]: 3 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. [2023-11-12 02:10:16,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-12 02:10:16,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:16,560 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-12 02:10:16,561 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-12 02:10:16,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-12 02:10:16,583 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-11-12 02:10:16,583 INFO L513 LassoAnalysis]: Proved termination. [2023-11-12 02:10:16,583 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 2*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~arr~0#1.offset >= 0] [2023-11-12 02:10:16,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:16,606 INFO L156 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2023-11-12 02:10:16,608 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~arr~0!base] could not be translated [2023-11-12 02:10:16,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:16,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 02:10:16,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:16,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 02:10:16,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:16,813 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2023-11-12 02:10:16,813 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 59 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:16,854 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 59 transitions. cyclomatic complexity: 20. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 51 states and 69 transitions. Complement of second has 6 states. [2023-11-12 02:10:16,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2023-11-12 02:10:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2023-11-12 02:10:16,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 19 letters. Loop has 2 letters. [2023-11-12 02:10:16,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:10:16,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 21 letters. Loop has 2 letters. [2023-11-12 02:10:16,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:10:16,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 19 letters. Loop has 4 letters. [2023-11-12 02:10:16,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-12 02:10:16,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2023-11-12 02:10:16,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:10:16,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 44 states and 56 transitions. [2023-11-12 02:10:16,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-11-12 02:10:16,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-11-12 02:10:16,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 56 transitions. [2023-11-12 02:10:16,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:10:16,861 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2023-11-12 02:10:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 56 transitions. [2023-11-12 02:10:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-12 02:10:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2023-11-12 02:10:16,865 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2023-11-12 02:10:16,865 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 56 transitions. [2023-11-12 02:10:16,865 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-11-12 02:10:16,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 56 transitions. [2023-11-12 02:10:16,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-11-12 02:10:16,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-12 02:10:16,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-12 02:10:16,867 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:10:16,867 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-12 02:10:16,867 INFO L748 eck$LassoCheckResult]: Stem: 3369#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_#t~nondet205#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3371#L367 assume !(main_~length~0#1 < 1); 3362#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1 % 18446744073709551616);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3363#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3364#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3372#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3400#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3373#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3374#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3375#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3378#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3399#L372 assume main_#t~mem209#1 < 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3398#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3396#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3394#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3392#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3390#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3388#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3386#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3385#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);havoc main_#t~nondet208#1;call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3380#L372 assume !(main_#t~mem209#1 < 0);havoc main_#t~mem209#1; 3381#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3379#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3365#L370-4 main_~j~0#1 := 0; 3366#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3403#L378 assume !(main_#t~mem210#1 < 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3404#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3401#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3376#L378-2 [2023-11-12 02:10:16,867 INFO L750 eck$LassoCheckResult]: Loop: 3376#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3377#L378 assume main_#t~mem210#1 < 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3376#L378-2 [2023-11-12 02:10:16,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:16,868 INFO L85 PathProgramCache]: Analyzing trace with hash 134458908, now seen corresponding path program 7 times [2023-11-12 02:10:16,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:16,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604015810] [2023-11-12 02:10:16,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:16,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:16,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:17,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:10:17,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604015810] [2023-11-12 02:10:17,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604015810] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:10:17,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139160396] [2023-11-12 02:10:17,463 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-12 02:10:17,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:10:17,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:10:17,464 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:10:17,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-11-12 02:10:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:10:17,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-12 02:10:17,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:10:17,653 INFO L351 Elim1Store]: Elim1 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 1 [2023-11-12 02:10:17,746 INFO L351 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-11-12 02:10:17,755 INFO L351 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-11-12 02:10:17,807 INFO L351 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-11-12 02:10:17,859 INFO L351 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-11-12 02:10:17,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:10:17,910 INFO L351 Elim1Store]: Elim1 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 27 treesize of output 11 [2023-11-12 02:10:18,018 INFO L351 Elim1Store]: Elim1 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 [2023-11-12 02:10:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:10:18,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:10:18,302 INFO L351 Elim1Store]: Elim1 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 20 treesize of output 18 [2023-11-12 02:10:18,305 INFO L351 Elim1Store]: Elim1 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 24 treesize of output 20 [2023-11-12 02:10:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-12 02:10:18,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139160396] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 02:10:18,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 02:10:18,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 28 [2023-11-12 02:10:18,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335583746] [2023-11-12 02:10:18,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 02:10:18,320 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-12 02:10:18,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:10:18,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 15 times [2023-11-12 02:10:18,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:10:18,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782311251] [2023-11-12 02:10:18,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:10:18,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:10:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:18,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:10:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:10:18,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:10:18,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:10:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-12 02:10:18,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2023-11-12 02:10:18,385 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. cyclomatic complexity: 16 Second operand has 29 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 29 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:10:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:10:18,679 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-11-12 02:10:18,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2023-11-12 02:10:18,680 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-12 02:10:18,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2023-11-12 02:10:18,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-11-12 02:10:18,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-11-12 02:10:18,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-11-12 02:10:18,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:10:18,681 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:10:18,681 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:10:18,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 02:10:18,681 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:10:18,681 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2023-11-12 02:10:18,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-11-12 02:10:18,682 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-11-12 02:10:18,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-11-12 02:10:18,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.11 02:10:18 BoogieIcfgContainer [2023-11-12 02:10:18,689 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-12 02:10:18,689 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:10:18,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:10:18,691 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:10:18,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:09:51" (3/4) ... [2023-11-12 02:10:18,693 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:10:18,694 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:10:18,695 INFO L158 Benchmark]: Toolchain (without parser) took 28153.76ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 129.3MB in the beginning and 206.8MB in the end (delta: -77.5MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2023-11-12 02:10:18,695 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 117.4MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:10:18,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.17ms. Allocated memory is still 165.7MB. Free memory was 128.8MB in the beginning and 111.8MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-12 02:10:18,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.11ms. Allocated memory is still 165.7MB. Free memory was 111.6MB in the beginning and 109.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:10:18,696 INFO L158 Benchmark]: Boogie Preprocessor took 58.11ms. Allocated memory is still 165.7MB. Free memory was 109.7MB in the beginning and 108.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:10:18,697 INFO L158 Benchmark]: RCFGBuilder took 406.87ms. Allocated memory is still 165.7MB. Free memory was 108.5MB in the beginning and 97.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-12 02:10:18,697 INFO L158 Benchmark]: BuchiAutomizer took 27089.31ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 97.6MB in the beginning and 206.8MB in the end (delta: -109.2MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2023-11-12 02:10:18,697 INFO L158 Benchmark]: Witness Printer took 5.00ms. Allocated memory is still 287.3MB. Free memory is still 206.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:10:18,699 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.70ms. Allocated memory is still 117.4MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.17ms. Allocated memory is still 165.7MB. Free memory was 128.8MB in the beginning and 111.8MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.11ms. Allocated memory is still 165.7MB. Free memory was 111.6MB in the beginning and 109.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.11ms. Allocated memory is still 165.7MB. Free memory was 109.7MB in the beginning and 108.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 406.87ms. Allocated memory is still 165.7MB. Free memory was 108.5MB in the beginning and 97.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 27089.31ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 97.6MB in the beginning and 206.8MB in the end (delta: -109.2MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Witness Printer took 5.00ms. Allocated memory is still 287.3MB. Free memory is still 206.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[~arr~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #length[~arr~0!base] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (15 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function NULL and consists of 5 locations. One deterministic module has affine ranking function NULL and consists of 4 locations. 15 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.0s and 18 iterations. TraceHistogramMax:6. Analysis of lassos took 18.8s. Construction of modules took 4.6s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 17. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 152 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 708 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 707 mSDsluCounter, 969 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 813 mSDsCounter, 208 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2786 IncrementalHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 208 mSolverCounterUnsat, 156 mSDtfsCounter, 2786 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc12 concLT0 SILN0 SILU3 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital137 mio100 ax100 hnf100 lsp96 ukn74 mio100 lsp57 div168 bol100 ite100 ukn100 eq146 hnf94 smp69 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-11-12 02:10:18,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:18,940 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:19,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-11-12 02:10:19,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:19,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-11-12 02:10:19,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:19,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-11-12 02:10:20,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:20,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:20,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-12 02:10:20,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-12 02:10:20,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-12 02:10:21,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-12 02:10:21,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-12 02:10:21,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_655f283f-590a-4e2b-9976-3e4577bfa5e2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE