./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e7bb482b 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_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:41:31,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:41:31,506 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-06 22:41:31,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:41:31,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:41:31,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:41:31,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:41:31,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:41:31,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:41:31,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:41:31,562 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:41:31,563 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-06 22:41:31,563 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-06 22:41:31,565 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-06 22:41:31,565 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-06 22:41:31,566 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-06 22:41:31,566 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-06 22:41:31,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:41:31,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-06 22:41:31,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:41:31,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:41:31,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-06 22:41:31,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-06 22:41:31,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-06 22:41:31,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:41:31,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:41:31,570 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-06 22:41:31,571 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:41:31,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:41:31,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:41:31,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:41:31,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:41:31,574 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-06 22:41:31,574 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_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/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_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 461dc838a66b90dbc84e0c687808dbd6d568e1b4ffb694b9909dedb46b2980b4 [2023-11-06 22:41:31,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:41:31,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:41:31,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:41:31,917 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:41:31,917 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:41:31,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2023-11-06 22:41:35,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:41:35,368 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:41:35,369 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/sv-benchmarks/c/termination-memory-alloca/c.08-alloca.i [2023-11-06 22:41:35,390 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/data/eba75decc/f430f3af5272406cb2da1791a046986f/FLAGeafc495e3 [2023-11-06 22:41:35,405 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/data/eba75decc/f430f3af5272406cb2da1791a046986f [2023-11-06 22:41:35,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:41:35,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:41:35,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:41:35,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:41:35,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:41:35,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:41:35" (1/1) ... [2023-11-06 22:41:35,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641a79ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35, skipping insertion in model container [2023-11-06 22:41:35,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:41:35" (1/1) ... [2023-11-06 22:41:35,484 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:41:35,777 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:41:35,791 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:41:35,858 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:41:35,892 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:41:35,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35 WrapperNode [2023-11-06 22:41:35,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:41:35,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:41:35,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:41:35,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:41:35,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35" (1/1) ... [2023-11-06 22:41:35,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35" (1/1) ... [2023-11-06 22:41:35,943 INFO L138 Inliner]: procedures = 111, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2023-11-06 22:41:35,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:41:35,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:41:35,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:41:35,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:41:35,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35" (1/1) ... [2023-11-06 22:41:35,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35" (1/1) ... [2023-11-06 22:41:35,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35" (1/1) ... [2023-11-06 22:41:35,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35" (1/1) ... [2023-11-06 22:41:35,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35" (1/1) ... [2023-11-06 22:41:35,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35" (1/1) ... [2023-11-06 22:41:35,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35" (1/1) ... [2023-11-06 22:41:35,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35" (1/1) ... [2023-11-06 22:41:35,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:41:35,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:41:35,970 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:41:35,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:41:35,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35" (1/1) ... [2023-11-06 22:41:35,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:35,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:36,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:36,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-06 22:41:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:41:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:41:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:41:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:41:36,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:41:36,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:41:36,163 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:41:36,165 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:41:36,401 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:41:36,407 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:41:36,407 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:41:36,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:41:36 BoogieIcfgContainer [2023-11-06 22:41:36,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:41:36,410 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-06 22:41:36,410 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-06 22:41:36,413 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-06 22:41:36,414 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:41:36,414 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.11 10:41:35" (1/3) ... [2023-11-06 22:41:36,415 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@769d336c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:41:36, skipping insertion in model container [2023-11-06 22:41:36,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:41:36,415 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:35" (2/3) ... [2023-11-06 22:41:36,415 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@769d336c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:41:36, skipping insertion in model container [2023-11-06 22:41:36,415 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:41:36,416 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:41:36" (3/3) ... [2023-11-06 22:41:36,417 INFO L332 chiAutomizerObserver]: Analyzing ICFG c.08-alloca.i [2023-11-06 22:41:36,477 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-06 22:41:36,479 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-06 22:41:36,479 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-06 22:41:36,480 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-06 22:41:36,480 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-06 22:41:36,480 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-06 22:41:36,480 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-06 22:41:36,481 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-06 22:41:36,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-06 22:41:36,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-06 22:41:36,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:36,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:36,513 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:41:36,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 22:41:36,514 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-06 22:41:36,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-06 22:41:36,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-06 22:41:36,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:36,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:36,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:41:36,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-06 22:41:36,524 INFO L748 eck$LassoCheckResult]: Stem: 5#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 3#L555-3true [2023-11-06 22:41:36,525 INFO L750 eck$LassoCheckResult]: Loop: 3#L555-3true call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 10#L555-1true assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 8#L557-3true assume !true; 12#L557-4true call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 3#L555-3true [2023-11-06 22:41:36,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:36,531 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-06 22:41:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:36,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410328485] [2023-11-06 22:41:36,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:36,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:36,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:36,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:36,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:36,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2023-11-06 22:41:36,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:36,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360335469] [2023-11-06 22:41:36,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:36,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:36,816 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-06 22:41:36,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:36,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360335469] [2023-11-06 22:41:36,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360335469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:36,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:36,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:41:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112245846] [2023-11-06 22:41:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:36,823 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:41:36,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:36,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:41:36,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:41:36,858 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-06 22:41:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:36,864 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2023-11-06 22:41:36,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2023-11-06 22:41:36,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-06 22:41:36,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2023-11-06 22:41:36,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-11-06 22:41:36,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2023-11-06 22:41:36,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2023-11-06 22:41:36,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:36,873 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2023-11-06 22:41:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2023-11-06 22:41:36,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2023-11-06 22:41:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 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-06 22:41:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2023-11-06 22:41:36,898 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2023-11-06 22:41:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:41:36,903 INFO L428 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2023-11-06 22:41:36,903 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-06 22:41:36,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2023-11-06 22:41:36,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-06 22:41:36,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:36,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:36,905 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:41:36,905 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-11-06 22:41:36,905 INFO L748 eck$LassoCheckResult]: Stem: 34#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 32#L555-3 [2023-11-06 22:41:36,905 INFO L750 eck$LassoCheckResult]: Loop: 32#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 33#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 36#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 37#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 38#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 32#L555-3 [2023-11-06 22:41:36,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-06 22:41:36,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:36,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622765483] [2023-11-06 22:41:36,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:36,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:36,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:36,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:36,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:36,965 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2023-11-06 22:41:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:36,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695096781] [2023-11-06 22:41:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:36,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:36,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:37,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2023-11-06 22:41:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:37,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726748936] [2023-11-06 22:41:37,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:37,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:37,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:37,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:38,091 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:41:38,092 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:41:38,092 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:41:38,092 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:41:38,092 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:41:38,093 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:38,093 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:41:38,093 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:41:38,093 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration2_Lasso [2023-11-06 22:41:38,094 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:41:38,094 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:41:38,120 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-06 22:41:38,130 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-06 22:41:38,133 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-06 22:41:38,137 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-06 22:41:38,140 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-06 22:41:38,143 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-06 22:41:38,146 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-06 22:41:38,149 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-06 22:41:38,152 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-06 22:41:38,156 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-06 22:41:38,161 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-06 22:41:38,163 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-06 22:41:39,004 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-06 22:41:39,008 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-06 22:41:39,490 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:41:39,496 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:41:39,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:39,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:39,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:39,522 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-06 22:41:39,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:39,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:39,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:39,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:39,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:39,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:39,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:39,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-06 22:41:39,548 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:39,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:39,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:39,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:39,559 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:39,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-06 22:41:39,571 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-06 22:41:39,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:39,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:39,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:39,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:39,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:39,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:39,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:39,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:39,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:39,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:39,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:39,602 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:39,615 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-06 22:41:39,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-06 22:41:39,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:39,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:39,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:39,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:39,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:39,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:39,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:39,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:39,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:39,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:39,682 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:39,690 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-06 22:41:39,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:39,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:39,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:39,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:39,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:39,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:39,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:39,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-06 22:41:39,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:39,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:39,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:39,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:39,735 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:39,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-06 22:41:39,740 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-06 22:41:39,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:39,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:39,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:39,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:39,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:39,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:39,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:39,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:39,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:39,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:39,793 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:39,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-06 22:41:39,802 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-06 22:41:39,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:39,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:39,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:39,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:39,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:39,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:39,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:39,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:39,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:39,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:39,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:39,849 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:39,859 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-06 22:41:39,871 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:39,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:39,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:39,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:39,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:39,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:39,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:39,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-06 22:41:39,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:39,883 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:39,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:39,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:39,886 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:39,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-06 22:41:39,894 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-06 22:41:39,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:39,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:39,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:39,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:39,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:39,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:39,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:39,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:39,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:39,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:39,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:39,927 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:39,935 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-06 22:41:39,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:39,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:39,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:39,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:39,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:39,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:39,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:39,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-06 22:41:39,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,008 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-06 22:41:40,020 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-06 22:41:40,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:40,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:40,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,065 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-06 22:41:40,070 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-06 22:41:40,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:40,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:40,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:40,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,109 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,118 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-06 22:41:40,118 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-06 22:41:40,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:40,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:40,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,158 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,167 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-06 22:41:40,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:40,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:40,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-06 22:41:40,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,211 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,223 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-06 22:41:40,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:40,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:40,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-06 22:41:40,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,263 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,271 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-06 22:41:40,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:40,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:40,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-06 22:41:40,299 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,305 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,319 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-06 22:41:40,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:40,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:40,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-06 22:41:40,353 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,363 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,375 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-06 22:41:40,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-06 22:41:40,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:40,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:40,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,406 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-06 22:41:40,419 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-06 22:41:40,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:40,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:40,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,457 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-06 22:41:40,466 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-06 22:41:40,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:40,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:40,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,496 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,498 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-06 22:41:40,502 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-06 22:41:40,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:40,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:40,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,547 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,554 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-06 22:41:40,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-06 22:41:40,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:40,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:40,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,605 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,610 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-06 22:41:40,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:40,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:40,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-06 22:41:40,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:40,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,641 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-11-06 22:41:40,646 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-06 22:41:40,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:40,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:40,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:40,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:40,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:40,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:40,698 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:41:40,709 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-11-06 22:41:40,710 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2023-11-06 22:41:40,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:40,712 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:40,742 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,746 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:41:40,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-06 22:41:40,772 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-06 22:41:40,772 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:41:40,773 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_1 + 1 Supporting invariants [] [2023-11-06 22:41:40,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,907 INFO L156 tatePredicateManager]: 26 out of 26 supporting invariants were superfluous and have been removed [2023-11-06 22:41:40,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:40,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:41:40,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:40,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:41:40,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:41,066 INFO L322 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2023-11-06 22:41:41,067 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 34 treesize of output 26 [2023-11-06 22:41:41,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:41,333 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-06 22:41:41,336 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2023-11-06 22:41:41,338 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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-06 22:41:41,597 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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) Result 17 states and 20 transitions. Complement of second has 11 states. [2023-11-06 22:41:41,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-11-06 22:41:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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-06 22:41:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2023-11-06 22:41:41,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2023-11-06 22:41:41,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:41:41,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2023-11-06 22:41:41,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:41:41,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2023-11-06 22:41:41,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:41:41,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2023-11-06 22:41:41,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-06 22:41:41,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2023-11-06 22:41:41,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-11-06 22:41:41,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2023-11-06 22:41:41,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2023-11-06 22:41:41,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:41:41,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-06 22:41:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2023-11-06 22:41:41,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-11-06 22:41:41,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 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-06 22:41:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-11-06 22:41:41,607 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-06 22:41:41,607 INFO L428 stractBuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-06 22:41:41,607 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-06 22:41:41,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2023-11-06 22:41:41,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-06 22:41:41,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:41,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:41,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:41:41,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-06 22:41:41,609 INFO L748 eck$LassoCheckResult]: Stem: 220#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 226#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 219#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 222#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 223#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 227#L557-3 [2023-11-06 22:41:41,610 INFO L750 eck$LassoCheckResult]: Loop: 227#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 230#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 227#L557-3 [2023-11-06 22:41:41,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:41,610 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2023-11-06 22:41:41,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:41,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871108637] [2023-11-06 22:41:41,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:41,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:41,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:41,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:41,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2023-11-06 22:41:41,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:41,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624362079] [2023-11-06 22:41:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:41,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:41,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:41,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:41,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:41,696 INFO L85 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2023-11-06 22:41:41,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:41,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280633243] [2023-11-06 22:41:41,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:41,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:41,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:43,319 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:41:43,319 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:41:43,319 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:41:43,319 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:41:43,319 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:41:43,320 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:43,320 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:41:43,320 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:41:43,320 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration3_Lasso [2023-11-06 22:41:43,320 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:41:43,320 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:41:43,324 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-06 22:41:43,327 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-06 22:41:43,330 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-06 22:41:43,820 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-06 22:41:43,823 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-06 22:41:43,825 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-06 22:41:43,828 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-06 22:41:43,831 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-06 22:41:43,833 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-06 22:41:43,836 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-06 22:41:43,839 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-06 22:41:43,841 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-06 22:41:43,844 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-06 22:41:43,847 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-06 22:41:43,850 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-06 22:41:43,852 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-06 22:41:43,855 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-06 22:41:44,284 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:41:44,284 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:41:44,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:44,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:44,289 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:44,300 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-06 22:41:44,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:44,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:44,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:44,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:44,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:44,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:44,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:44,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-06 22:41:44,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:44,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:44,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:44,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:44,343 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:44,350 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-06 22:41:44,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-06 22:41:44,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:44,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:44,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:44,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:44,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:44,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:44,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:44,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:44,380 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:44,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:44,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:44,382 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:44,386 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-06 22:41:44,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:44,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:44,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:44,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:44,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-06 22:41:44,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:44,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:44,422 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:41:44,440 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-11-06 22:41:44,440 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-11-06 22:41:44,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:44,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:44,442 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:44,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-06 22:41:44,445 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:41:44,456 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-06 22:41:44,457 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:41:44,457 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0#1.base) ULTIMATE.start_test_fun_~j_ref~0#1.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_2 Supporting invariants [] [2023-11-06 22:41:44,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:44,562 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2023-11-06 22:41:44,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:44,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:41:44,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:44,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:41:44,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:44,681 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-06 22:41:44,682 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-06 22:41:44,682 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 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-06 22:41:44,727 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. 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 26 states and 31 transitions. Complement of second has 7 states. [2023-11-06 22:41:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-06 22:41:44,730 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-06 22:41:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2023-11-06 22:41:44,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 6 letters. Loop has 2 letters. [2023-11-06 22:41:44,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:41:44,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 2 letters. [2023-11-06 22:41:44,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:41:44,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 6 letters. Loop has 4 letters. [2023-11-06 22:41:44,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:41:44,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2023-11-06 22:41:44,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-06 22:41:44,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 23 states and 28 transitions. [2023-11-06 22:41:44,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2023-11-06 22:41:44,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-11-06 22:41:44,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2023-11-06 22:41:44,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:41:44,742 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-11-06 22:41:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2023-11-06 22:41:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-11-06 22:41:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 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-06 22:41:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2023-11-06 22:41:44,746 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-06 22:41:44,746 INFO L428 stractBuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2023-11-06 22:41:44,746 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-06 22:41:44,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2023-11-06 22:41:44,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-06 22:41:44,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:44,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:44,749 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:44,749 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-11-06 22:41:44,749 INFO L748 eck$LassoCheckResult]: Stem: 389#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 390#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 396#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 388#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 403#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 398#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 399#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 395#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 400#L557-4 [2023-11-06 22:41:44,749 INFO L750 eck$LassoCheckResult]: Loop: 400#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 384#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 385#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 391#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 392#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 400#L557-4 [2023-11-06 22:41:44,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 1 times [2023-11-06 22:41:44,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:44,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79880020] [2023-11-06 22:41:44,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:44,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:44,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:44,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:44,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:44,827 INFO L85 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 2 times [2023-11-06 22:41:44,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:44,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889494322] [2023-11-06 22:41:44,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:44,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:44,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:44,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:44,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:44,863 INFO L85 PathProgramCache]: Analyzing trace with hash -474670094, now seen corresponding path program 1 times [2023-11-06 22:41:44,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:44,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840786664] [2023-11-06 22:41:44,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:44,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:44,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:44,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:46,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:46,448 INFO L210 LassoAnalysis]: Preferences: [2023-11-06 22:41:46,448 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-06 22:41:46,448 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-06 22:41:46,448 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-06 22:41:46,448 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-06 22:41:46,448 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:46,448 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-06 22:41:46,448 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-06 22:41:46,448 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.08-alloca.i_Iteration4_Lasso [2023-11-06 22:41:46,448 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-06 22:41:46,448 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-06 22:41:46,452 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-06 22:41:46,455 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-06 22:41:46,458 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-06 22:41:46,461 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-06 22:41:46,463 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-06 22:41:46,466 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-06 22:41:46,469 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-06 22:41:46,471 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-06 22:41:46,474 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-06 22:41:46,477 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-06 22:41:46,479 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-06 22:41:46,481 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-06 22:41:46,484 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-06 22:41:46,488 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-06 22:41:46,491 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-06 22:41:47,120 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-06 22:41:47,532 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-06 22:41:47,532 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-06 22:41:47,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,538 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-06 22:41:47,562 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-06 22:41:47,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:47,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:47,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:47,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:47,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,578 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-06 22:41:47,583 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-06 22:41:47,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:47,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:47,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:47,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-11-06 22:41:47,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,599 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-06 22:41:47,602 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-06 22:41:47,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:47,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:47,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:47,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,621 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-06 22:41:47,627 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-06 22:41:47,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:47,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:47,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:47,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-11-06 22:41:47,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,643 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-06 22:41:47,645 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-06 22:41:47,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:47,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:47,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:47,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-11-06 22:41:47,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,662 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-11-06 22:41:47,666 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-06 22:41:47,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:47,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:47,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:47,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2023-11-06 22:41:47,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,682 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,694 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-06 22:41:47,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-11-06 22:41:47,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:47,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:47,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:47,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-11-06 22:41:47,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,725 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-11-06 22:41:47,729 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-06 22:41:47,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:47,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:47,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:47,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,777 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,782 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-06 22:41:47,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-11-06 22:41:47,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:47,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:47,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:47,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:47,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,804 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-11-06 22:41:47,812 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-06 22:41:47,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:47,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:47,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:47,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:47,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,827 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-11-06 22:41:47,834 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-06 22:41:47,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:47,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:47,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:47,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:47,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,849 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-11-06 22:41:47,851 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-06 22:41:47,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:47,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:47,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2023-11-06 22:41:47,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,871 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-11-06 22:41:47,873 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-06 22:41:47,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:47,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:47,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2023-11-06 22:41:47,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,892 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-11-06 22:41:47,894 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-06 22:41:47,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:47,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:47,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-11-06 22:41:47,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,912 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-11-06 22:41:47,915 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-06 22:41:47,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-06 22:41:47,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-06 22:41:47,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-06 22:41:47,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-06 22:41:47,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2023-11-06 22:41:47,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:47,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:47,945 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:47,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-11-06 22:41:47,949 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-06 22:41:47,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-06 22:41:47,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-06 22:41:47,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-06 22:41:47,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-06 22:41:47,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-06 22:41:47,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-06 22:41:47,986 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-06 22:41:48,018 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-11-06 22:41:48,018 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. [2023-11-06 22:41:48,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:48,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:48,022 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:48,026 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-06 22:41:48,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-11-06 22:41:48,062 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-06 22:41:48,062 INFO L513 LassoAnalysis]: Proved termination. [2023-11-06 22:41:48,062 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0#1.base) ULTIMATE.start_test_fun_~i_ref~0#1.offset)_3 Supporting invariants [] [2023-11-06 22:41:48,066 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:48,172 INFO L156 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2023-11-06 22:41:48,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:48,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:41:48,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:48,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-06 22:41:48,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:48,255 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 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-06 22:41:48,318 INFO L322 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2023-11-06 22:41:48,319 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 32 treesize of output 24 [2023-11-06 22:41:48,441 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-06 22:41:48,442 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2023-11-06 22:41:48,442 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-06 22:41:48,489 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 48 states and 58 transitions. Complement of second has 9 states. [2023-11-06 22:41:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-06 22:41:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-06 22:41:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2023-11-06 22:41:48,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 5 letters. [2023-11-06 22:41:48,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:41:48,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 5 letters. [2023-11-06 22:41:48,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:41:48,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 10 letters. [2023-11-06 22:41:48,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-06 22:41:48,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2023-11-06 22:41:48,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-06 22:41:48,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 46 transitions. [2023-11-06 22:41:48,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-11-06 22:41:48,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-11-06 22:41:48,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2023-11-06 22:41:48,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:41:48,502 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2023-11-06 22:41:48,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2023-11-06 22:41:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2023-11-06 22:41:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 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-06 22:41:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2023-11-06 22:41:48,514 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 42 transitions. [2023-11-06 22:41:48,514 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2023-11-06 22:41:48,514 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-06 22:41:48,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2023-11-06 22:41:48,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2023-11-06 22:41:48,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:48,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:48,515 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2023-11-06 22:41:48,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-11-06 22:41:48,516 INFO L748 eck$LassoCheckResult]: Stem: 616#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 617#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 622#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 626#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 620#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 621#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 624#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 628#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 638#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 618#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 619#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 623#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 630#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 627#L557-4 [2023-11-06 22:41:48,516 INFO L750 eck$LassoCheckResult]: Loop: 627#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 612#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 613#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 625#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 643#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 627#L557-4 [2023-11-06 22:41:48,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash -652525668, now seen corresponding path program 2 times [2023-11-06 22:41:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642496236] [2023-11-06 22:41:48,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:48,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:48,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:41:48,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:48,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642496236] [2023-11-06 22:41:48,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642496236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:48,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:48,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:41:48,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987011346] [2023-11-06 22:41:48,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:48,808 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-06 22:41:48,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 3 times [2023-11-06 22:41:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:48,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775929035] [2023-11-06 22:41:48,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:48,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:48,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:48,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:48,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:41:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:41:48,922 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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-06 22:41:48,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:48,986 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2023-11-06 22:41:48,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2023-11-06 22:41:48,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-11-06 22:41:48,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 22 states and 25 transitions. [2023-11-06 22:41:48,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-11-06 22:41:48,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-11-06 22:41:48,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2023-11-06 22:41:48,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:41:48,988 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-06 22:41:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2023-11-06 22:41:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2023-11-06 22:41:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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-06 22:41:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2023-11-06 22:41:48,990 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-11-06 22:41:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:41:48,991 INFO L428 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2023-11-06 22:41:48,991 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-06 22:41:48,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2023-11-06 22:41:48,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2023-11-06 22:41:48,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:48,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:48,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:48,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2023-11-06 22:41:48,993 INFO L748 eck$LassoCheckResult]: Stem: 700#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 701#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 707#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 713#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 712#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 711#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 710#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 705#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 709#L557-4 [2023-11-06 22:41:48,993 INFO L750 eck$LassoCheckResult]: Loop: 709#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 698#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 699#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 702#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 703#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 708#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 714#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 709#L557-4 [2023-11-06 22:41:48,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:48,994 INFO L85 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 2 times [2023-11-06 22:41:48,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:48,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978761960] [2023-11-06 22:41:48,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:48,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:49,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:49,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:49,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash -739883290, now seen corresponding path program 1 times [2023-11-06 22:41:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:49,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684757721] [2023-11-06 22:41:49,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:49,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:49,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:49,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:49,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash -891424489, now seen corresponding path program 3 times [2023-11-06 22:41:49,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:49,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171995916] [2023-11-06 22:41:49,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:49,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:49,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:49,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171995916] [2023-11-06 22:41:49,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171995916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:49,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706802694] [2023-11-06 22:41:49,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:41:49,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:49,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:49,490 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:49,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2023-11-06 22:41:49,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:41:49,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:41:49,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-06 22:41:49,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:49,614 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 10 treesize of output 8 [2023-11-06 22:41:49,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:41:49,650 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 25 treesize of output 13 [2023-11-06 22:41:49,720 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-11-06 22:41:49,767 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2023-11-06 22:41:49,797 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:41:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:49,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:50,394 INFO L322 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2023-11-06 22:41:50,394 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 1 [2023-11-06 22:41:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:50,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706802694] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:41:50,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:41:50,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2023-11-06 22:41:50,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534659739] [2023-11-06 22:41:50,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:41:50,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:50,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 22:41:50,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:41:50,606 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 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-06 22:41:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:50,855 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2023-11-06 22:41:50,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2023-11-06 22:41:50,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2023-11-06 22:41:50,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 22 transitions. [2023-11-06 22:41:50,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-11-06 22:41:50,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-11-06 22:41:50,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2023-11-06 22:41:50,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:41:50,856 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-11-06 22:41:50,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2023-11-06 22:41:50,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2023-11-06 22:41:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 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-06 22:41:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-11-06 22:41:50,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-11-06 22:41:50,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:41:50,859 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-11-06 22:41:50,859 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-06 22:41:50,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2023-11-06 22:41:50,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2023-11-06 22:41:50,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:50,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:50,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1] [2023-11-06 22:41:50,860 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2023-11-06 22:41:50,860 INFO L748 eck$LassoCheckResult]: Stem: 864#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 865#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 862#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 863#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 871#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 870#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 866#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 867#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 868#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 869#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 872#L557-4 [2023-11-06 22:41:50,860 INFO L750 eck$LassoCheckResult]: Loop: 872#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 873#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 880#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 879#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 878#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 877#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 876#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 874#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 875#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 872#L557-4 [2023-11-06 22:41:50,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:50,860 INFO L85 PathProgramCache]: Analyzing trace with hash 765528213, now seen corresponding path program 3 times [2023-11-06 22:41:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:50,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982620525] [2023-11-06 22:41:50,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:50,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:50,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:50,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:50,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1936731915, now seen corresponding path program 2 times [2023-11-06 22:41:50,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:50,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277382285] [2023-11-06 22:41:50,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:50,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:50,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:50,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:50,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:50,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1863480073, now seen corresponding path program 4 times [2023-11-06 22:41:50,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:50,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235315957] [2023-11-06 22:41:50,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:50,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:51,884 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:51,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:51,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235315957] [2023-11-06 22:41:51,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235315957] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:51,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418716431] [2023-11-06 22:41:51,884 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:41:51,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:51,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:51,886 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:51,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2023-11-06 22:41:51,990 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:41:51,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:41:51,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-06 22:41:51,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:52,024 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-06 22:41:52,099 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 22:41:52,100 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2023-11-06 22:41:52,166 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-11-06 22:41:52,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2023-11-06 22:41:52,423 INFO L322 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-06 22:41:52,423 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 20 [2023-11-06 22:41:52,492 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:41:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:52,596 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:53,356 INFO L322 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2023-11-06 22:41:53,356 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 1 [2023-11-06 22:41:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:53,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418716431] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:41:53,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:41:53,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 35 [2023-11-06 22:41:53,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467248153] [2023-11-06 22:41:53,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:41:53,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:53,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-06 22:41:53,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=966, Unknown=0, NotChecked=0, Total=1190 [2023-11-06 22:41:53,636 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand has 35 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 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-06 22:41:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:54,206 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2023-11-06 22:41:54,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2023-11-06 22:41:54,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2023-11-06 22:41:54,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 26 transitions. [2023-11-06 22:41:54,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-11-06 22:41:54,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-11-06 22:41:54,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2023-11-06 22:41:54,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:41:54,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-11-06 22:41:54,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2023-11-06 22:41:54,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2023-11-06 22:41:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 22 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-06 22:41:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-11-06 22:41:54,210 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-11-06 22:41:54,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:41:54,211 INFO L428 stractBuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-11-06 22:41:54,211 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-06 22:41:54,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2023-11-06 22:41:54,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2023-11-06 22:41:54,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:54,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:54,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1] [2023-11-06 22:41:54,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2023-11-06 22:41:54,213 INFO L748 eck$LassoCheckResult]: Stem: 1082#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1083#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1084#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1100#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1099#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1098#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1096#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1095#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1087#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1088#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1090#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1092#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1091#L557-4 [2023-11-06 22:41:54,213 INFO L750 eck$LassoCheckResult]: Loop: 1091#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 1080#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1081#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1085#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1086#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1089#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1102#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1101#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1097#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1093#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1094#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1091#L557-4 [2023-11-06 22:41:54,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:54,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1233207546, now seen corresponding path program 4 times [2023-11-06 22:41:54,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:54,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990930754] [2023-11-06 22:41:54,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:54,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:54,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:54,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:54,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:54,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1478533616, now seen corresponding path program 3 times [2023-11-06 22:41:54,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:54,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383199269] [2023-11-06 22:41:54,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:54,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:54,275 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:54,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:54,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1457439913, now seen corresponding path program 5 times [2023-11-06 22:41:54,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:54,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281534420] [2023-11-06 22:41:54,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:54,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 24 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:55,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:55,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281534420] [2023-11-06 22:41:55,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281534420] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:55,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039420384] [2023-11-06 22:41:55,250 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:41:55,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:55,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:55,257 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:55,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2023-11-06 22:41:55,392 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-06 22:41:55,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:41:55,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-06 22:41:55,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:55,431 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-06 22:41:55,480 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 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:41:55,515 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 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 22:41:55,608 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 22:41:55,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2023-11-06 22:41:55,787 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-11-06 22:41:55,873 INFO L322 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-06 22:41:55,874 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 20 [2023-11-06 22:41:55,946 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:41:56,013 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:41:56,067 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:41:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 20 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:56,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:57,179 INFO L322 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2023-11-06 22:41:57,179 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 1 [2023-11-06 22:41:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 21 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:57,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039420384] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:41:57,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:41:57,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 44 [2023-11-06 22:41:57,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960096573] [2023-11-06 22:41:57,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:41:57,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:57,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-06 22:41:57,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1578, Unknown=0, NotChecked=0, Total=1892 [2023-11-06 22:41:57,640 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. cyclomatic complexity: 4 Second operand has 44 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 44 states have internal predecessors, (63), 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-06 22:41:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:58,493 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2023-11-06 22:41:58,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 41 transitions. [2023-11-06 22:41:58,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2023-11-06 22:41:58,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 30 transitions. [2023-11-06 22:41:58,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-11-06 22:41:58,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-11-06 22:41:58,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 30 transitions. [2023-11-06 22:41:58,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:41:58,501 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-11-06 22:41:58,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 30 transitions. [2023-11-06 22:41:58,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-11-06 22:41:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 26 states have internal predecessors, (29), 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-06 22:41:58,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-11-06 22:41:58,505 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-11-06 22:41:58,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:41:58,506 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-11-06 22:41:58,521 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-06 22:41:58,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2023-11-06 22:41:58,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2023-11-06 22:41:58,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:58,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:58,523 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1] [2023-11-06 22:41:58,523 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2023-11-06 22:41:58,523 INFO L748 eck$LassoCheckResult]: Stem: 1353#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1354#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1359#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1362#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1363#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1360#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1355#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1356#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1377#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1361#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1357#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1358#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1366#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1365#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1364#L557-4 [2023-11-06 22:41:58,524 INFO L750 eck$LassoCheckResult]: Loop: 1364#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 1351#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1352#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1376#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1375#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1374#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1373#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1372#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1371#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1370#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1369#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1367#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1368#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1364#L557-4 [2023-11-06 22:41:58,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:58,524 INFO L85 PathProgramCache]: Analyzing trace with hash -298519521, now seen corresponding path program 5 times [2023-11-06 22:41:58,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:58,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92811941] [2023-11-06 22:41:58,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:58,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:58,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:58,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:58,596 INFO L85 PathProgramCache]: Analyzing trace with hash -763367531, now seen corresponding path program 4 times [2023-11-06 22:41:58,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:58,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910100321] [2023-11-06 22:41:58,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:58,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:58,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:58,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:58,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:58,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1962220599, now seen corresponding path program 6 times [2023-11-06 22:41:58,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:58,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875070322] [2023-11-06 22:41:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:41:59,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:59,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875070322] [2023-11-06 22:41:59,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875070322] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:41:59,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886056280] [2023-11-06 22:41:59,931 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:41:59,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:41:59,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:59,934 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:41:59,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2023-11-06 22:42:00,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-11-06 22:42:00,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:42:00,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-06 22:42:00,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:00,143 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 10 treesize of output 8 [2023-11-06 22:42:00,162 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:42:00,190 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 25 treesize of output 13 [2023-11-06 22:42:00,205 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 25 treesize of output 13 [2023-11-06 22:42:00,217 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 25 treesize of output 13 [2023-11-06 22:42:00,229 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 25 treesize of output 13 [2023-11-06 22:42:00,306 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-11-06 22:42:00,359 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2023-11-06 22:42:00,402 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:42:00,452 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:42:00,502 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:42:00,542 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:42:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 29 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:42:00,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:42:32,748 INFO L322 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2023-11-06 22:42:32,749 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 1 [2023-11-06 22:42:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 29 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:42:32,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886056280] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:42:32,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:42:32,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 15] total 45 [2023-11-06 22:42:32,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096504360] [2023-11-06 22:42:32,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:42:33,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:33,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-06 22:42:33,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1633, Unknown=1, NotChecked=0, Total=1980 [2023-11-06 22:42:33,886 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 4 Second operand has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 45 states have internal predecessors, (73), 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-06 22:42:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:34,779 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2023-11-06 22:42:34,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 47 transitions. [2023-11-06 22:42:34,779 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2023-11-06 22:42:34,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 32 states and 34 transitions. [2023-11-06 22:42:34,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-11-06 22:42:34,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-11-06 22:42:34,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 34 transitions. [2023-11-06 22:42:34,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:42:34,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-11-06 22:42:34,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 34 transitions. [2023-11-06 22:42:34,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-11-06 22:42:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.064516129032258) internal successors, (33), 30 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-06 22:42:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2023-11-06 22:42:34,783 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 33 transitions. [2023-11-06 22:42:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:42:34,783 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2023-11-06 22:42:34,784 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-06 22:42:34,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2023-11-06 22:42:34,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2023-11-06 22:42:34,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:42:34,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:42:34,785 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 1, 1, 1, 1, 1] [2023-11-06 22:42:34,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1] [2023-11-06 22:42:34,785 INFO L748 eck$LassoCheckResult]: Stem: 1654#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1655#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1652#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1653#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1656#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1657#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1660#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1661#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1658#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1659#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1682#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1680#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1678#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1668#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1667#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1664#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1662#L557-4 [2023-11-06 22:42:34,785 INFO L750 eck$LassoCheckResult]: Loop: 1662#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 1663#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1681#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 1679#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1677#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1676#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1675#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1674#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1673#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1672#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1671#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1670#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1669#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 1665#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 1666#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 1662#L557-4 [2023-11-06 22:42:34,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash 885551620, now seen corresponding path program 6 times [2023-11-06 22:42:34,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:34,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129587136] [2023-11-06 22:42:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:34,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:42:34,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:42:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:42:34,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:42:34,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:34,832 INFO L85 PathProgramCache]: Analyzing trace with hash 843212794, now seen corresponding path program 5 times [2023-11-06 22:42:34,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:34,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436689443] [2023-11-06 22:42:34,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:34,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:42:34,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:42:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:42:34,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:42:34,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:34,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1845317527, now seen corresponding path program 7 times [2023-11-06 22:42:34,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:34,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880604406] [2023-11-06 22:42:34,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:34,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 44 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:42:36,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:36,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880604406] [2023-11-06 22:42:36,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880604406] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:36,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552933521] [2023-11-06 22:42:36,855 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 22:42:36,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:36,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:36,864 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:42:36,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2023-11-06 22:42:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:37,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-06 22:42:37,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:37,084 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-06 22:42:37,235 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 22:42:37,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2023-11-06 22:42:37,338 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-11-06 22:42:37,435 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-06 22:42:37,544 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-06 22:42:37,656 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-06 22:42:37,948 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2023-11-06 22:42:38,079 INFO L322 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-06 22:42:38,079 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 20 [2023-11-06 22:42:38,171 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:42:38,262 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:42:38,362 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:42:38,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:42:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 40 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:42:38,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:42:40,366 INFO L322 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2023-11-06 22:42:40,366 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 1 [2023-11-06 22:42:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 41 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:42:40,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552933521] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:42:40,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:42:40,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 18] total 60 [2023-11-06 22:42:40,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612932629] [2023-11-06 22:42:40,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:42:42,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:42,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-11-06 22:42:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=588, Invalid=2952, Unknown=0, NotChecked=0, Total=3540 [2023-11-06 22:42:42,142 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand has 60 states, 60 states have (on average 1.45) internal successors, (87), 60 states have internal predecessors, (87), 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-06 22:42:43,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:42:43,725 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2023-11-06 22:42:43,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 53 transitions. [2023-11-06 22:42:43,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2023-11-06 22:42:43,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 38 transitions. [2023-11-06 22:42:43,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-11-06 22:42:43,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-11-06 22:42:43,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2023-11-06 22:42:43,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:42:43,729 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 38 transitions. [2023-11-06 22:42:43,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2023-11-06 22:42:43,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2023-11-06 22:42:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 34 states have internal predecessors, (37), 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-06 22:42:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2023-11-06 22:42:43,732 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 37 transitions. [2023-11-06 22:42:43,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 22:42:43,733 INFO L428 stractBuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2023-11-06 22:42:43,733 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-06 22:42:43,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 37 transitions. [2023-11-06 22:42:43,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2023-11-06 22:42:43,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:42:43,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:42:43,735 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 1, 1, 1, 1, 1] [2023-11-06 22:42:43,735 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2023-11-06 22:42:43,735 INFO L748 eck$LassoCheckResult]: Stem: 2017#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2018#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 2015#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2016#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 2019#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2020#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2023#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2024#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2021#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2022#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2049#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2048#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2047#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2045#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2043#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2029#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2028#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2027#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 2025#L557-4 [2023-11-06 22:42:43,735 INFO L750 eck$LassoCheckResult]: Loop: 2025#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 2026#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2046#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 2044#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2042#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2041#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2040#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2039#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2038#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2037#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2036#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2035#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2034#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2033#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2032#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2030#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2031#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 2025#L557-4 [2023-11-06 22:42:43,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:43,736 INFO L85 PathProgramCache]: Analyzing trace with hash 611584681, now seen corresponding path program 7 times [2023-11-06 22:42:43,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:43,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626726023] [2023-11-06 22:42:43,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:43,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:42:43,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:42:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:42:43,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:42:43,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:43,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1421321441, now seen corresponding path program 6 times [2023-11-06 22:42:43,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:43,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645082524] [2023-11-06 22:42:43,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:43,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:42:43,792 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:42:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:42:43,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:42:43,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:43,807 INFO L85 PathProgramCache]: Analyzing trace with hash 803599735, now seen corresponding path program 8 times [2023-11-06 22:42:43,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:43,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029302900] [2023-11-06 22:42:43,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:46,177 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 54 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:42:46,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:46,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029302900] [2023-11-06 22:42:46,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029302900] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:42:46,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186867966] [2023-11-06 22:42:46,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:42:46,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:42:46,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:46,185 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:42:46,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2023-11-06 22:42:46,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:42:46,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:42:46,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-06 22:42:46,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:42:46,369 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 10 treesize of output 8 [2023-11-06 22:42:46,384 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:42:46,445 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 25 treesize of output 13 [2023-11-06 22:42:46,466 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 25 treesize of output 13 [2023-11-06 22:42:46,485 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 25 treesize of output 13 [2023-11-06 22:42:46,505 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 25 treesize of output 13 [2023-11-06 22:42:46,521 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 25 treesize of output 13 [2023-11-06 22:42:46,544 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 25 treesize of output 13 [2023-11-06 22:42:46,697 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-11-06 22:42:46,783 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2023-11-06 22:42:46,870 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:42:46,952 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:42:47,024 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:42:47,115 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:42:47,191 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:42:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 53 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:42:47,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:43:59,177 INFO L322 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2023-11-06 22:43:59,178 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 1 [2023-11-06 22:43:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 53 proven. 131 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:59,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186867966] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:43:59,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:43:59,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20, 19] total 58 [2023-11-06 22:43:59,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135529446] [2023-11-06 22:43:59,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:44:01,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:01,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-06 22:44:01,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=2757, Unknown=1, NotChecked=0, Total=3306 [2023-11-06 22:44:01,917 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. cyclomatic complexity: 4 Second operand has 58 states, 58 states have (on average 1.6724137931034482) internal successors, (97), 58 states have internal predecessors, (97), 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-06 22:44:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:03,211 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2023-11-06 22:44:03,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 59 transitions. [2023-11-06 22:44:03,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-11-06 22:44:03,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 40 states and 42 transitions. [2023-11-06 22:44:03,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2023-11-06 22:44:03,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2023-11-06 22:44:03,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 42 transitions. [2023-11-06 22:44:03,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:44:03,213 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 42 transitions. [2023-11-06 22:44:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 42 transitions. [2023-11-06 22:44:03,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2023-11-06 22:44:03,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 38 states have internal predecessors, (41), 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-06 22:44:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2023-11-06 22:44:03,216 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 41 transitions. [2023-11-06 22:44:03,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-06 22:44:03,217 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2023-11-06 22:44:03,217 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-06 22:44:03,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2023-11-06 22:44:03,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2023-11-06 22:44:03,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:44:03,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:44:03,219 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 1, 1, 1, 1, 1] [2023-11-06 22:44:03,219 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1] [2023-11-06 22:44:03,219 INFO L748 eck$LassoCheckResult]: Stem: 2411#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2412#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 2409#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2410#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 2418#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2417#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2413#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2414#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2415#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2416#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2447#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2446#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2445#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2444#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2443#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2441#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2439#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2425#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2424#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2421#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 2419#L557-4 [2023-11-06 22:44:03,219 INFO L750 eck$LassoCheckResult]: Loop: 2419#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 2420#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2442#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 2440#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2438#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2437#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2436#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2435#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2434#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2433#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2432#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2431#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2430#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2429#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2428#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2427#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2426#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2422#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2423#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 2419#L557-4 [2023-11-06 22:44:03,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash -677638642, now seen corresponding path program 8 times [2023-11-06 22:44:03,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:03,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655957050] [2023-11-06 22:44:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:03,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:44:03,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:44:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:44:03,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:44:03,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:03,263 INFO L85 PathProgramCache]: Analyzing trace with hash -90302204, now seen corresponding path program 7 times [2023-11-06 22:44:03,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:03,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872747471] [2023-11-06 22:44:03,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:03,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:44:03,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:44:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:44:03,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:44:03,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:03,297 INFO L85 PathProgramCache]: Analyzing trace with hash 41102807, now seen corresponding path program 9 times [2023-11-06 22:44:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:03,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309717096] [2023-11-06 22:44:03,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:03,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 70 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:44:06,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:06,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309717096] [2023-11-06 22:44:06,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309717096] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:44:06,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931932686] [2023-11-06 22:44:06,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:44:06,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:44:06,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:44:06,029 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:44:06,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2023-11-06 22:44:06,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-11-06 22:44:06,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:44:06,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-06 22:44:06,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:44:06,624 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 10 treesize of output 8 [2023-11-06 22:44:06,640 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:44:06,702 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 25 treesize of output 13 [2023-11-06 22:44:06,721 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 25 treesize of output 13 [2023-11-06 22:44:06,740 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 25 treesize of output 13 [2023-11-06 22:44:06,758 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 25 treesize of output 13 [2023-11-06 22:44:06,776 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 25 treesize of output 13 [2023-11-06 22:44:06,795 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 25 treesize of output 13 [2023-11-06 22:44:06,814 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 25 treesize of output 13 [2023-11-06 22:44:06,974 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2023-11-06 22:44:07,062 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2023-11-06 22:44:07,145 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:44:07,225 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:44:07,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:44:07,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:44:07,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:44:07,549 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:44:07,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-06 22:44:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 68 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:44:07,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:45:12,396 INFO L322 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2023-11-06 22:45:12,397 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 1 [2023-11-06 22:45:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 68 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:12,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931932686] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:45:12,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:45:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 22, 21] total 65 [2023-11-06 22:45:12,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71139423] [2023-11-06 22:45:12,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:45:17,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:17,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-11-06 22:45:17,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=3479, Unknown=1, NotChecked=0, Total=4160 [2023-11-06 22:45:17,051 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 4 Second operand has 65 states, 65 states have (on average 1.676923076923077) internal successors, (109), 65 states have internal predecessors, (109), 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-06 22:45:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:18,548 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2023-11-06 22:45:18,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 65 transitions. [2023-11-06 22:45:18,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2023-11-06 22:45:18,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 44 states and 46 transitions. [2023-11-06 22:45:18,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-11-06 22:45:18,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-11-06 22:45:18,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 46 transitions. [2023-11-06 22:45:18,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:45:18,550 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 46 transitions. [2023-11-06 22:45:18,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 46 transitions. [2023-11-06 22:45:18,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2023-11-06 22:45:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 42 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-06 22:45:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2023-11-06 22:45:18,554 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 45 transitions. [2023-11-06 22:45:18,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-06 22:45:18,556 INFO L428 stractBuchiCegarLoop]: Abstraction has 43 states and 45 transitions. [2023-11-06 22:45:18,556 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-11-06 22:45:18,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 45 transitions. [2023-11-06 22:45:18,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2023-11-06 22:45:18,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:18,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:18,558 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 1, 1, 1, 1, 1] [2023-11-06 22:45:18,558 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 8, 1, 1, 1, 1] [2023-11-06 22:45:18,558 INFO L748 eck$LassoCheckResult]: Stem: 2852#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2853#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 2850#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2851#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 2859#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2858#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2854#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2855#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2856#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2857#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2892#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2891#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2890#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2889#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2888#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2887#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2886#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2884#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2882#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2866#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2865#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2862#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 2860#L557-4 [2023-11-06 22:45:18,559 INFO L750 eck$LassoCheckResult]: Loop: 2860#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 2861#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2885#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 2883#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2881#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2880#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2879#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2878#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2877#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2876#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2875#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2874#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2873#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2872#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2871#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2870#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2869#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2868#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2867#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 2863#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 2864#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 2860#L557-4 [2023-11-06 22:45:18,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:18,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1624296499, now seen corresponding path program 9 times [2023-11-06 22:45:18,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:18,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276356020] [2023-11-06 22:45:18,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:18,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:18,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:18,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:18,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:18,623 INFO L85 PathProgramCache]: Analyzing trace with hash -881069655, now seen corresponding path program 8 times [2023-11-06 22:45:18,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:18,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022532576] [2023-11-06 22:45:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:18,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:18,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:18,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:18,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:18,696 INFO L85 PathProgramCache]: Analyzing trace with hash -478078793, now seen corresponding path program 10 times [2023-11-06 22:45:18,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:18,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699496072] [2023-11-06 22:45:18,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:18,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:45:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 88 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:21,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:45:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699496072] [2023-11-06 22:45:21,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699496072] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:45:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107949868] [2023-11-06 22:45:21,905 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:45:21,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:45:21,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:45:21,908 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:45:21,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c07dae-f00b-47fb-a521-561485d12229/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2023-11-06 22:45:22,087 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:45:22,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:45:22,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-06 22:45:22,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:45:22,148 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-06 22:45:22,294 INFO L322 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-06 22:45:22,294 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2023-11-06 22:45:22,397 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-11-06 22:45:22,500 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-06 22:45:22,607 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-06 22:45:22,702 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-06 22:45:22,822 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-06 22:45:22,938 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-06 22:45:23,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-06 22:45:23,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2023-11-06 22:45:23,517 INFO L322 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-06 22:45:23,517 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 20 [2023-11-06 22:45:23,637 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:45:23,748 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:45:23,864 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:45:23,979 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:45:24,096 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:45:24,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:45:24,341 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-11-06 22:45:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 85 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:24,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:45:27,636 INFO L322 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2023-11-06 22:45:27,636 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 1 [2023-11-06 22:45:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 86 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:45:27,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107949868] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:45:27,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:45:27,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 25, 24] total 83 [2023-11-06 22:45:27,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704578323] [2023-11-06 22:45:27,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:45:32,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:45:32,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2023-11-06 22:45:32,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1100, Invalid=5706, Unknown=0, NotChecked=0, Total=6806 [2023-11-06 22:45:32,294 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. cyclomatic complexity: 4 Second operand has 83 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 83 states have internal predecessors, (123), 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-06 22:45:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:45:35,003 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2023-11-06 22:45:35,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 71 transitions. [2023-11-06 22:45:35,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-06 22:45:35,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 48 states and 50 transitions. [2023-11-06 22:45:35,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-11-06 22:45:35,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-11-06 22:45:35,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 50 transitions. [2023-11-06 22:45:35,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-06 22:45:35,005 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 50 transitions. [2023-11-06 22:45:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 50 transitions. [2023-11-06 22:45:35,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2023-11-06 22:45:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 46 states have internal predecessors, (49), 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-06 22:45:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2023-11-06 22:45:35,009 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 49 transitions. [2023-11-06 22:45:35,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-06 22:45:35,009 INFO L428 stractBuchiCegarLoop]: Abstraction has 47 states and 49 transitions. [2023-11-06 22:45:35,009 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-11-06 22:45:35,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 49 transitions. [2023-11-06 22:45:35,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-06 22:45:35,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:45:35,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:45:35,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1, 1, 1, 1] [2023-11-06 22:45:35,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2023-11-06 22:45:35,011 INFO L748 eck$LassoCheckResult]: Stem: 3358#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3359#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~ret13#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;assume { :begin_inline_test_fun } true;test_fun_#in~i#1, test_fun_#in~j#1 := main_#t~nondet11#1, main_#t~nondet12#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~mem6#1, test_fun_#t~mem9#1, test_fun_#t~mem5#1, test_fun_#t~mem10#1, test_fun_~i#1, test_fun_~j#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~i#1 := test_fun_#in~i#1;test_fun_~j#1 := test_fun_#in~j#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~i#1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_~j#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 3356#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3357#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 3366#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3364#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3360#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3361#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3362#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3363#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3365#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3402#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3401#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3400#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3399#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3398#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3397#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3396#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3395#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3393#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3391#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3373#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3372#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3369#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 3367#L557-4 [2023-11-06 22:45:35,012 INFO L750 eck$LassoCheckResult]: Loop: 3367#L557-4 call test_fun_#t~mem9#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);call write~int(test_fun_#t~mem9#1 - 1, test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4);havoc test_fun_#t~mem9#1; 3368#L555-3 call test_fun_#t~mem5#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3394#L555-1 assume !!(test_fun_#t~mem5#1 >= 0);havoc test_fun_#t~mem5#1;call write~int(0, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4); 3392#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3390#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3389#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3388#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3387#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3386#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3385#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3384#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3383#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3382#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3381#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3380#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3379#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3378#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3377#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3376#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3375#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3374#L557-1 assume !!(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1;call test_fun_#t~mem8#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1; 3370#L557-3 call test_fun_#t~mem7#1 := read~int(test_fun_~j_ref~0#1.base, test_fun_~j_ref~0#1.offset, 4);call test_fun_#t~mem6#1 := read~int(test_fun_~i_ref~0#1.base, test_fun_~i_ref~0#1.offset, 4); 3371#L557-1 assume !(test_fun_#t~mem7#1 <= test_fun_#t~mem6#1 - 1);havoc test_fun_#t~mem7#1;havoc test_fun_#t~mem6#1; 3367#L557-4 [2023-11-06 22:45:35,012 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:35,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1875809560, now seen corresponding path program 10 times [2023-11-06 22:45:35,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:35,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042489268] [2023-11-06 22:45:35,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:35,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:35,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:35,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:35,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:35,057 INFO L85 PathProgramCache]: Analyzing trace with hash -599378674, now seen corresponding path program 9 times [2023-11-06 22:45:35,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:35,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173582026] [2023-11-06 22:45:35,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:35,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:35,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:35,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:45:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:45:35,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:45:35,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:45:35,097 INFO L85 PathProgramCache]: Analyzing trace with hash 285464087, now seen corresponding path program 11 times [2023-11-06 22:45:35,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:45:35,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283702243] [2023-11-06 22:45:35,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:45:35,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:45:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat