./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max05-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:17:44,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:17:44,401 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 16:17:44,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:17:44,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:17:44,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:17:44,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:17:44,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:17:44,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:17:44,447 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:17:44,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:17:44,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:17:44,448 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:17:44,449 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 16:17:44,449 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 16:17:44,449 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 16:17:44,449 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 16:17:44,450 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 16:17:44,450 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 16:17:44,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:17:44,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 16:17:44,450 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:17:44,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:17:44,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:17:44,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:17:44,450 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 16:17:44,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 16:17:44,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 16:17:44,451 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:17:44,451 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:17:44,451 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:17:44,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:17:44,451 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 16:17:44,451 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:17:44,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:17:44,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:17:44,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:17:44,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:17:44,452 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 16:17:44,452 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e48915cf0eaefe43320bbe59bf88f5c68b2f305d293e808fa6ece9112b5c238 [2024-11-13 16:17:44,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:17:44,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:17:44,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:17:44,795 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:17:44,795 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:17:44,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/reducercommutativity/max05-1.i Unable to find full path for "g++" [2024-11-13 16:17:46,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:17:46,925 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:17:46,926 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/sv-benchmarks/c/reducercommutativity/max05-1.i [2024-11-13 16:17:46,939 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/data/e5dd371ce/38db31a3eb8941c3a42d13bc2bafb1a6/FLAG96806c610 [2024-11-13 16:17:46,986 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/data/e5dd371ce/38db31a3eb8941c3a42d13bc2bafb1a6 [2024-11-13 16:17:46,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:17:46,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:17:46,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:17:46,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:17:47,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:17:47,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:17:46" (1/1) ... [2024-11-13 16:17:47,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc22709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47, skipping insertion in model container [2024-11-13 16:17:47,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:17:46" (1/1) ... [2024-11-13 16:17:47,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:17:47,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:17:47,215 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:17:47,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:17:47,256 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:17:47,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47 WrapperNode [2024-11-13 16:17:47,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:17:47,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:17:47,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:17:47,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:17:47,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47" (1/1) ... [2024-11-13 16:17:47,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47" (1/1) ... [2024-11-13 16:17:47,291 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 131 [2024-11-13 16:17:47,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:17:47,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:17:47,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:17:47,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:17:47,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47" (1/1) ... [2024-11-13 16:17:47,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47" (1/1) ... [2024-11-13 16:17:47,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47" (1/1) ... [2024-11-13 16:17:47,318 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-13 16:17:47,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47" (1/1) ... [2024-11-13 16:17:47,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47" (1/1) ... [2024-11-13 16:17:47,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47" (1/1) ... [2024-11-13 16:17:47,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47" (1/1) ... [2024-11-13 16:17:47,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47" (1/1) ... [2024-11-13 16:17:47,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47" (1/1) ... [2024-11-13 16:17:47,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:17:47,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:17:47,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:17:47,333 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:17:47,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47" (1/1) ... [2024-11-13 16:17:47,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:47,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:47,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:47,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 16:17:47,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:17:47,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:17:47,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 16:17:47,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 16:17:47,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 16:17:47,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 16:17:47,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:17:47,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:17:47,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 16:17:47,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 16:17:47,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 16:17:47,471 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:17:47,473 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:17:47,693 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-13 16:17:47,694 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:17:47,702 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:17:47,703 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-13 16:17:47,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:17:47 BoogieIcfgContainer [2024-11-13 16:17:47,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:17:47,704 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 16:17:47,704 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 16:17:47,709 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 16:17:47,709 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 16:17:47,710 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 04:17:46" (1/3) ... [2024-11-13 16:17:47,711 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d1795b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 04:17:47, skipping insertion in model container [2024-11-13 16:17:47,711 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 16:17:47,711 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:17:47" (2/3) ... [2024-11-13 16:17:47,711 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d1795b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 04:17:47, skipping insertion in model container [2024-11-13 16:17:47,711 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 16:17:47,711 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:17:47" (3/3) ... [2024-11-13 16:17:47,712 INFO L333 chiAutomizerObserver]: Analyzing ICFG max05-1.i [2024-11-13 16:17:47,767 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 16:17:47,767 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 16:17:47,767 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 16:17:47,767 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 16:17:47,767 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 16:17:47,767 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 16:17:47,767 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 16:17:47,768 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 16:17:47,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 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) [2024-11-13 16:17:47,789 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2024-11-13 16:17:47,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:17:47,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:17:47,794 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:17:47,794 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 16:17:47,794 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 16:17:47,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 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) [2024-11-13 16:17:47,796 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2024-11-13 16:17:47,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:17:47,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:17:47,796 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 16:17:47,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 16:17:47,803 INFO L745 eck$LassoCheckResult]: Stem: 26#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 7#L34-2true [2024-11-13 16:17:47,804 INFO L747 eck$LassoCheckResult]: Loop: 7#L34-2true assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 7#L34-2true [2024-11-13 16:17:47,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-13 16:17:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:47,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582455664] [2024-11-13 16:17:47,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:47,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:47,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:17:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:47,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:17:47,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:47,929 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 1 times [2024-11-13 16:17:47,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:47,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162046721] [2024-11-13 16:17:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:47,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:47,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:17:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:47,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:17:47,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:47,947 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-11-13 16:17:47,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:47,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012330857] [2024-11-13 16:17:47,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:47,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:47,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:17:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:47,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:17:48,461 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 16:17:48,462 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 16:17:48,462 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 16:17:48,462 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 16:17:48,462 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-13 16:17:48,463 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:48,463 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 16:17:48,463 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 16:17:48,463 INFO L132 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration1_Lasso [2024-11-13 16:17:48,464 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 16:17:48,464 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 16:17:48,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:48,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:49,051 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 16:17:49,055 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-13 16:17:49,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-13 16:17:49,063 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 [2024-11-13 16:17:49,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:49,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:49,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:49,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-13 16:17:49,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-13 16:17:49,116 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 [2024-11-13 16:17:49,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:17:49,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:17:49,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-13 16:17:49,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,162 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-13 16:17:49,166 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 [2024-11-13 16:17:49,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:17:49,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:17:49,196 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-13 16:17:49,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-13 16:17:49,221 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 [2024-11-13 16:17:49,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:49,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:49,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:49,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-13 16:17:49,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-13 16:17:49,267 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 [2024-11-13 16:17:49,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:49,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:49,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:49,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-13 16:17:49,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-13 16:17:49,311 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 [2024-11-13 16:17:49,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:49,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:49,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:49,329 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,347 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-13 16:17:49,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,350 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-13 16:17:49,353 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 [2024-11-13 16:17:49,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:49,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:49,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:49,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-13 16:17:49,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-13 16:17:49,393 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 [2024-11-13 16:17:49,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:49,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:49,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:49,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-13 16:17:49,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,430 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-13 16:17:49,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 16:17:49,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:49,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:49,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:49,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-13 16:17:49,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,475 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-13 16:17:49,477 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 [2024-11-13 16:17:49,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:49,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:49,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:49,496 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-13 16:17:49,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,517 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-13 16:17:49,520 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 [2024-11-13 16:17:49,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:49,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:49,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:49,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-13 16:17:49,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,562 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-13 16:17:49,566 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 [2024-11-13 16:17:49,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:49,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,582 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:49,582 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:49,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-11-13 16:17:49,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,607 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-13 16:17:49,611 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 [2024-11-13 16:17:49,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:49,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:49,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:49,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-13 16:17:49,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,658 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-13 16:17:49,661 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 [2024-11-13 16:17:49,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,679 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:17:49,679 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:17:49,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-13 16:17:49,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,704 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-13 16:17:49,731 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 [2024-11-13 16:17:49,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,749 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:17:49,749 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:17:49,754 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-13 16:17:49,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,775 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,777 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 [2024-11-13 16:17:49,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-13 16:17:49,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,797 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:17:49,797 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:17:49,803 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-11-13 16:17:49,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,826 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-13 16:17:49,830 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 [2024-11-13 16:17:49,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:17:49,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:17:49,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:49,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-13 16:17:49,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,874 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-13 16:17:49,877 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 [2024-11-13 16:17:49,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:49,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:49,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:49,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:49,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:17:49,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:17:49,909 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-13 16:17:49,942 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-13 16:17:49,945 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-13 16:17:49,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:49,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:49,949 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:49,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-13 16:17:49,953 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-13 16:17:49,970 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-13 16:17:49,970 INFO L474 LassoAnalysis]: Proved termination. [2024-11-13 16:17:49,971 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2024-11-13 16:17:49,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-11-13 16:17:50,009 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-13 16:17:50,020 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 16:17:50,021 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 16:17:50,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:50,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 16:17:50,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:17:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:50,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:17:50,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:17:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:17:50,117 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-13 16:17:50,118 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 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) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-11-13 16:17:50,153 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 27 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). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 54 states and 82 transitions. Complement of second has 4 states. [2024-11-13 16:17:50,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-13 16:17:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-11-13 16:17:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-11-13 16:17:50,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 2 letters. Loop has 1 letters. [2024-11-13 16:17:50,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 16:17:50,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 3 letters. Loop has 1 letters. [2024-11-13 16:17:50,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 16:17:50,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 41 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-13 16:17:50,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 16:17:50,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 82 transitions. [2024-11-13 16:17:50,170 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-11-13 16:17:50,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 20 states and 31 transitions. [2024-11-13 16:17:50,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-13 16:17:50,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-13 16:17:50,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2024-11-13 16:17:50,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:17:50,175 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 31 transitions. [2024-11-13 16:17:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2024-11-13 16:17:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-13 16:17:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:17:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2024-11-13 16:17:50,200 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 31 transitions. [2024-11-13 16:17:50,200 INFO L424 stractBuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2024-11-13 16:17:50,200 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 16:17:50,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2024-11-13 16:17:50,201 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-11-13 16:17:50,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:17:50,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:17:50,201 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-13 16:17:50,201 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 16:17:50,202 INFO L745 eck$LassoCheckResult]: Stem: 143#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 135#L34-2 assume !(main_~i~1#1 < 5); 137#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 139#L20-2 [2024-11-13 16:17:50,202 INFO L747 eck$LassoCheckResult]: Loop: 139#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 141#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 142#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 139#L20-2 [2024-11-13 16:17:50,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:50,202 INFO L85 PathProgramCache]: Analyzing trace with hash 925705, now seen corresponding path program 1 times [2024-11-13 16:17:50,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:50,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815718516] [2024-11-13 16:17:50,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:17:50,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:17:50,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815718516] [2024-11-13 16:17:50,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815718516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:17:50,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:17:50,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:17:50,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396240947] [2024-11-13 16:17:50,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:17:50,279 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 16:17:50,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:50,279 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2024-11-13 16:17:50,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:50,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289996452] [2024-11-13 16:17:50,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:50,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:50,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:17:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:50,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:17:50,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:17:50,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:17:50,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:17:50,393 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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) [2024-11-13 16:17:50,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:17:50,406 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2024-11-13 16:17:50,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2024-11-13 16:17:50,409 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-11-13 16:17:50,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2024-11-13 16:17:50,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-13 16:17:50,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-13 16:17:50,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2024-11-13 16:17:50,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:17:50,410 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-13 16:17:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2024-11-13 16:17:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-13 16:17:50,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:17:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2024-11-13 16:17:50,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-13 16:17:50,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:17:50,415 INFO L424 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-13 16:17:50,415 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 16:17:50,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2024-11-13 16:17:50,416 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-11-13 16:17:50,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:17:50,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:17:50,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-13 16:17:50,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 16:17:50,416 INFO L745 eck$LassoCheckResult]: Stem: 189#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 180#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 181#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 183#L34-2 assume !(main_~i~1#1 < 5); 184#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 187#L20-2 [2024-11-13 16:17:50,416 INFO L747 eck$LassoCheckResult]: Loop: 187#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 185#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 186#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 187#L20-2 [2024-11-13 16:17:50,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:50,417 INFO L85 PathProgramCache]: Analyzing trace with hash 28698605, now seen corresponding path program 1 times [2024-11-13 16:17:50,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:50,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493938040] [2024-11-13 16:17:50,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:50,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:17:50,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:17:50,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493938040] [2024-11-13 16:17:50,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493938040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:17:50,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547903961] [2024-11-13 16:17:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:50,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:17:50,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:50,519 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:17:50,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 16:17:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:50,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 16:17:50,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:17:50,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:17:50,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:17:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:17:50,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547903961] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:17:50,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:17:50,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-13 16:17:50,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498580976] [2024-11-13 16:17:50,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:17:50,614 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 16:17:50,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:50,615 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 2 times [2024-11-13 16:17:50,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:50,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814541419] [2024-11-13 16:17:50,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:50,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:50,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:17:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:50,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:17:50,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:17:50,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:17:50,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:17:50,708 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 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) [2024-11-13 16:17:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:17:50,731 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2024-11-13 16:17:50,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2024-11-13 16:17:50,732 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-11-13 16:17:50,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2024-11-13 16:17:50,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-13 16:17:50,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-13 16:17:50,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2024-11-13 16:17:50,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:17:50,733 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-13 16:17:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2024-11-13 16:17:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-13 16:17:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 states have internal predecessors, (30), 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) [2024-11-13 16:17:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-11-13 16:17:50,735 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-13 16:17:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:17:50,736 INFO L424 stractBuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-11-13 16:17:50,737 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 16:17:50,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2024-11-13 16:17:50,737 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-11-13 16:17:50,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:17:50,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:17:50,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1] [2024-11-13 16:17:50,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 16:17:50,738 INFO L745 eck$LassoCheckResult]: Stem: 266#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 257#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 258#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 260#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 261#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 272#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 271#L34-2 assume !(main_~i~1#1 < 5); 270#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 262#L20-2 [2024-11-13 16:17:50,738 INFO L747 eck$LassoCheckResult]: Loop: 262#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 264#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 265#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 262#L20-2 [2024-11-13 16:17:50,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash 263387401, now seen corresponding path program 2 times [2024-11-13 16:17:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:50,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927330453] [2024-11-13 16:17:50,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:50,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:17:50,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:17:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927330453] [2024-11-13 16:17:50,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927330453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:17:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858027277] [2024-11-13 16:17:50,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:17:50,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:17:50,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:50,879 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:17:50,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-13 16:17:50,957 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:17:50,958 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:17:50,959 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:17:50,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:17:50,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:17:50,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:17:50,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-11-13 16:17:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:17:51,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858027277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:17:51,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:17:51,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-13 16:17:51,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073858374] [2024-11-13 16:17:51,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:17:51,041 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 16:17:51,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 3 times [2024-11-13 16:17:51,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:51,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862355413] [2024-11-13 16:17:51,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:51,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:51,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:17:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:51,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:17:51,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:17:51,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:17:51,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:17:51,137 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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) [2024-11-13 16:17:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:17:51,156 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2024-11-13 16:17:51,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2024-11-13 16:17:51,157 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-11-13 16:17:51,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 31 transitions. [2024-11-13 16:17:51,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-13 16:17:51,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-13 16:17:51,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2024-11-13 16:17:51,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:17:51,159 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-13 16:17:51,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2024-11-13 16:17:51,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-13 16:17:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:17:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-13 16:17:51,161 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-13 16:17:51,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:17:51,162 INFO L424 stractBuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-13 16:17:51,162 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 16:17:51,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2024-11-13 16:17:51,163 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-11-13 16:17:51,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:17:51,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:17:51,164 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1] [2024-11-13 16:17:51,164 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 16:17:51,164 INFO L745 eck$LassoCheckResult]: Stem: 366#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 357#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 358#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 360#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 361#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 373#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 372#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 371#L34-2 assume !(main_~i~1#1 < 5); 370#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 362#L20-2 [2024-11-13 16:17:51,164 INFO L747 eck$LassoCheckResult]: Loop: 362#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 364#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 365#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 362#L20-2 [2024-11-13 16:17:51,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:51,165 INFO L85 PathProgramCache]: Analyzing trace with hash -424923411, now seen corresponding path program 3 times [2024-11-13 16:17:51,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:51,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498285266] [2024-11-13 16:17:51,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:51,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:51,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:17:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:51,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:17:51,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:51,203 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 4 times [2024-11-13 16:17:51,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:51,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737498848] [2024-11-13 16:17:51,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:51,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:17:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:51,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:17:51,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1624693843, now seen corresponding path program 1 times [2024-11-13 16:17:51,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:51,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448354614] [2024-11-13 16:17:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:51,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:51,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:17:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:51,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:17:52,539 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 16:17:52,540 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 16:17:52,540 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 16:17:52,540 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 16:17:52,540 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-13 16:17:52,540 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:52,540 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 16:17:52,540 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 16:17:52,540 INFO L132 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration5_Lasso [2024-11-13 16:17:52,540 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 16:17:52,540 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 16:17:52,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:52,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:17:53,212 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 16:17:53,212 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-13 16:17:53,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:53,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:53,215 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:53,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-11-13 16:17:53,218 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 [2024-11-13 16:17:53,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:53,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:53,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:53,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:53,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:53,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:53,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:53,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:53,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-13 16:17:53,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:53,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:53,250 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:53,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-11-13 16:17:53,253 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 [2024-11-13 16:17:53,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:53,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:53,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:53,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:53,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:53,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:53,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:53,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:53,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-13 16:17:53,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:53,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:53,281 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:53,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-13 16:17:53,283 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 [2024-11-13 16:17:53,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:53,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:53,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:53,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:53,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:53,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:53,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:53,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:53,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-13 16:17:53,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:53,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:53,310 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:53,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-13 16:17:53,312 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 [2024-11-13 16:17:53,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:53,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:17:53,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:53,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:53,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:53,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:17:53,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:17:53,327 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:53,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-13 16:17:53,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:53,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:53,344 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:53,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-13 16:17:53,345 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 [2024-11-13 16:17:53,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:53,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:53,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:53,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:53,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:17:53,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:17:53,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:53,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-13 16:17:53,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:53,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:53,390 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:53,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2024-11-13 16:17:53,393 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 [2024-11-13 16:17:53,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:53,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:53,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:53,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:53,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:17:53,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:17:53,417 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:53,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-11-13 16:17:53,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:53,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:53,437 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:53,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2024-11-13 16:17:53,440 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 [2024-11-13 16:17:53,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:53,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:53,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:53,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:53,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:17:53,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:17:53,463 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:53,481 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-13 16:17:53,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:53,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:53,484 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:53,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2024-11-13 16:17:53,489 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 [2024-11-13 16:17:53,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:53,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:53,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:53,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:53,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:17:53,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:17:53,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:53,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2024-11-13 16:17:53,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:53,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:53,537 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:53,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2024-11-13 16:17:53,539 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 [2024-11-13 16:17:53,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:53,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:53,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:53,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:53,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:17:53,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:17:53,558 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:17:53,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-13 16:17:53,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:53,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:53,581 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:53,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2024-11-13 16:17:53,586 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 [2024-11-13 16:17:53,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:17:53,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:17:53,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:17:53,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:17:53,606 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:17:53,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:17:53,618 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-13 16:17:53,646 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-13 16:17:53,647 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-13 16:17:53,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:17:53,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:53,650 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:17:53,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2024-11-13 16:17:53,652 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-13 16:17:53,668 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-13 16:17:53,668 INFO L474 LassoAnalysis]: Proved termination. [2024-11-13 16:17:53,669 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1) = -2*ULTIMATE.start_max_~i~0#1 + 9 Supporting invariants [] [2024-11-13 16:17:53,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-13 16:17:53,719 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-13 16:17:53,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:53,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 16:17:53,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:17:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:53,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 16:17:53,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:17:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:17:53,819 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 [2024-11-13 16:17:53,820 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 31 transitions. cyclomatic complexity: 12 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) [2024-11-13 16:17:53,847 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 31 transitions. cyclomatic complexity: 12. 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 27 states and 37 transitions. Complement of second has 5 states. [2024-11-13 16:17:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-13 16:17:53,848 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) [2024-11-13 16:17:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2024-11-13 16:17:53,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2024-11-13 16:17:53,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 16:17:53,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 12 letters. Loop has 3 letters. [2024-11-13 16:17:53,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 16:17:53,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 6 letters. [2024-11-13 16:17:53,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 16:17:53,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2024-11-13 16:17:53,851 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-13 16:17:53,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 33 transitions. [2024-11-13 16:17:53,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2024-11-13 16:17:53,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-11-13 16:17:53,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2024-11-13 16:17:53,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:17:53,852 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-11-13 16:17:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2024-11-13 16:17:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-13 16:17:53,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.32) internal successors, (33), 24 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) [2024-11-13 16:17:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-11-13 16:17:53,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-11-13 16:17:53,859 INFO L424 stractBuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-11-13 16:17:53,859 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 16:17:53,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2024-11-13 16:17:53,860 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-13 16:17:53,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:17:53,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:17:53,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:17:53,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 16:17:53,864 INFO L745 eck$LassoCheckResult]: Stem: 506#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 496#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 497#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 499#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 500#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 513#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 512#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 511#L34-2 assume !(main_~i~1#1 < 5); 510#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 501#L20-2 assume !(max_~i~0#1 < 5); 502#L20-3 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 493#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 494#L20-6 [2024-11-13 16:17:53,865 INFO L747 eck$LassoCheckResult]: Loop: 494#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 489#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 490#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 494#L20-6 [2024-11-13 16:17:53,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:53,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1624695511, now seen corresponding path program 1 times [2024-11-13 16:17:53,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:53,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264295855] [2024-11-13 16:17:53,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:53,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 16:17:53,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:17:53,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264295855] [2024-11-13 16:17:53,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264295855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:17:53,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:17:53,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:17:53,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078106308] [2024-11-13 16:17:53,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:17:53,991 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 16:17:53,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash 72652, now seen corresponding path program 1 times [2024-11-13 16:17:53,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:53,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278002631] [2024-11-13 16:17:53,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:53,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:54,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:17:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:54,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:17:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:17:54,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:17:54,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:17:54,079 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 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) [2024-11-13 16:17:54,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:17:54,116 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2024-11-13 16:17:54,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2024-11-13 16:17:54,118 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-13 16:17:54,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2024-11-13 16:17:54,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-13 16:17:54,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2024-11-13 16:17:54,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2024-11-13 16:17:54,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:17:54,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-13 16:17:54,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2024-11-13 16:17:54,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2024-11-13 16:17:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:17:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-13 16:17:54,122 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-13 16:17:54,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:17:54,123 INFO L424 stractBuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-13 16:17:54,124 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 16:17:54,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2024-11-13 16:17:54,124 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-13 16:17:54,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:17:54,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:17:54,125 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:17:54,125 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 16:17:54,126 INFO L745 eck$LassoCheckResult]: Stem: 571#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 560#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 561#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 563#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 564#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 578#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 577#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 576#L34-2 assume !(main_~i~1#1 < 5); 575#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 566#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 567#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 570#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 568#L20-2 assume !(max_~i~0#1 < 5); 569#L20-3 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 557#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 558#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 553#L21-3 [2024-11-13 16:17:54,126 INFO L747 eck$LassoCheckResult]: Loop: 553#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 554#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 565#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 553#L21-3 [2024-11-13 16:17:54,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash -589771232, now seen corresponding path program 1 times [2024-11-13 16:17:54,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:54,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265437312] [2024-11-13 16:17:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:54,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 16:17:54,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:17:54,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265437312] [2024-11-13 16:17:54,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265437312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:17:54,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899458368] [2024-11-13 16:17:54,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:54,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:17:54,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:54,220 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:17:54,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2024-11-13 16:17:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:54,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 16:17:54,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:17:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 16:17:54,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:17:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 16:17:54,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899458368] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:17:54,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:17:54,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-13 16:17:54,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4746114] [2024-11-13 16:17:54,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:17:54,362 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 16:17:54,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:54,363 INFO L85 PathProgramCache]: Analyzing trace with hash 77512, now seen corresponding path program 2 times [2024-11-13 16:17:54,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:54,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515421743] [2024-11-13 16:17:54,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:54,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:17:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:54,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:17:54,467 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-13 16:17:54,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:17:54,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 16:17:54,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-13 16:17:54,481 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2024-11-13 16:17:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:17:54,594 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2024-11-13 16:17:54,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 70 transitions. [2024-11-13 16:17:54,595 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-13 16:17:54,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 70 transitions. [2024-11-13 16:17:54,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-11-13 16:17:54,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-13 16:17:54,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 70 transitions. [2024-11-13 16:17:54,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:17:54,601 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 70 transitions. [2024-11-13 16:17:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 70 transitions. [2024-11-13 16:17:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2024-11-13 16:17:54,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 43 states have internal predecessors, (57), 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) [2024-11-13 16:17:54,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2024-11-13 16:17:54,607 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 57 transitions. [2024-11-13 16:17:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:17:54,609 INFO L424 stractBuchiCegarLoop]: Abstraction has 44 states and 57 transitions. [2024-11-13 16:17:54,609 INFO L331 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-13 16:17:54,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 57 transitions. [2024-11-13 16:17:54,610 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-13 16:17:54,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:17:54,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:17:54,610 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:17:54,611 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 16:17:54,611 INFO L745 eck$LassoCheckResult]: Stem: 752#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 740#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 741#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 743#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 744#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 761#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 758#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 757#L34-2 assume !(main_~i~1#1 < 5); 756#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 746#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 747#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 750#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 748#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 749#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 776#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 775#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 774#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 773#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 772#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 767#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 769#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 766#L20-2 assume !(max_~i~0#1 < 5); 751#L20-3 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 737#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 738#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 733#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 734#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 745#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 771#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 770#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 768#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 765#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 764#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 763#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 760#L21-3 [2024-11-13 16:17:54,611 INFO L747 eck$LassoCheckResult]: Loop: 760#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 762#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 759#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 760#L21-3 [2024-11-13 16:17:54,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:54,612 INFO L85 PathProgramCache]: Analyzing trace with hash 317717477, now seen corresponding path program 1 times [2024-11-13 16:17:54,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:54,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973884798] [2024-11-13 16:17:54,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:54,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 16:17:54,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:17:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973884798] [2024-11-13 16:17:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973884798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:17:54,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321940574] [2024-11-13 16:17:54,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:54,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:17:54,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:54,791 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:17:54,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-13 16:17:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:54,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:17:54,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:17:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 16:17:54,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:17:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-13 16:17:55,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321940574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:17:55,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:17:55,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-13 16:17:55,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461026374] [2024-11-13 16:17:55,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:17:55,013 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 16:17:55,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:55,013 INFO L85 PathProgramCache]: Analyzing trace with hash 77512, now seen corresponding path program 3 times [2024-11-13 16:17:55,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:55,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153969306] [2024-11-13 16:17:55,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:55,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:55,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:17:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:55,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:17:55,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:17:55,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:17:55,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:17:55,094 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. cyclomatic complexity: 18 Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:17:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:17:55,230 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2024-11-13 16:17:55,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 82 transitions. [2024-11-13 16:17:55,231 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-13 16:17:55,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 82 transitions. [2024-11-13 16:17:55,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2024-11-13 16:17:55,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2024-11-13 16:17:55,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 82 transitions. [2024-11-13 16:17:55,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:17:55,235 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-11-13 16:17:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 82 transitions. [2024-11-13 16:17:55,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2024-11-13 16:17:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.3) internal successors, (65), 49 states have internal predecessors, (65), 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) [2024-11-13 16:17:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2024-11-13 16:17:55,238 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 65 transitions. [2024-11-13 16:17:55,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:17:55,240 INFO L424 stractBuchiCegarLoop]: Abstraction has 50 states and 65 transitions. [2024-11-13 16:17:55,240 INFO L331 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-13 16:17:55,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 65 transitions. [2024-11-13 16:17:55,241 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-13 16:17:55,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:17:55,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:17:55,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:17:55,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 16:17:55,242 INFO L745 eck$LassoCheckResult]: Stem: 1068#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1056#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1057#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1059#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1060#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1078#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1075#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1074#L34-2 assume !(main_~i~1#1 < 5); 1073#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1062#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1063#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1070#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1064#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1065#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1066#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1098#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1097#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1096#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1095#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1093#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1091#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1089#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1084#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1086#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1083#L20-2 assume !(max_~i~0#1 < 5); 1067#L20-3 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1054#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1055#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1049#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 1050#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1061#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1094#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 1092#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1090#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1088#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 1087#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1085#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1082#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 1081#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1080#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1077#L21-3 [2024-11-13 16:17:55,242 INFO L747 eck$LassoCheckResult]: Loop: 1077#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1079#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1076#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1077#L21-3 [2024-11-13 16:17:55,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1321114848, now seen corresponding path program 2 times [2024-11-13 16:17:55,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:55,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772087274] [2024-11-13 16:17:55,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:55,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:17:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 16:17:56,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:17:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772087274] [2024-11-13 16:17:56,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772087274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:17:56,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037624763] [2024-11-13 16:17:56,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:17:56,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:17:56,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:17:56,535 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:17:56,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2024-11-13 16:17:56,663 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:17:56,663 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:17:56,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 16:17:56,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:17:56,899 INFO L378 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 41 treesize of output 11 [2024-11-13 16:17:57,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:17:57,065 INFO L378 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 1 case distinctions, treesize of input 29 treesize of output 13 [2024-11-13 16:17:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 16:17:57,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:17:57,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:17:57,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-11-13 16:17:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 16:17:57,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037624763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:17:57,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:17:57,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 28 [2024-11-13 16:17:57,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948145182] [2024-11-13 16:17:57,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:17:57,446 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 16:17:57,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:57,446 INFO L85 PathProgramCache]: Analyzing trace with hash 77512, now seen corresponding path program 4 times [2024-11-13 16:17:57,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:57,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369797304] [2024-11-13 16:17:57,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:57,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:57,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:17:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:17:57,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:17:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:17:57,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-13 16:17:57,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2024-11-13 16:17:57,525 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. cyclomatic complexity: 20 Second operand has 28 states, 28 states have (on average 2.0) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:17:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:17:58,974 INFO L93 Difference]: Finished difference Result 149 states and 191 transitions. [2024-11-13 16:17:58,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 191 transitions. [2024-11-13 16:17:58,976 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 16 [2024-11-13 16:17:58,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 191 transitions. [2024-11-13 16:17:58,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2024-11-13 16:17:58,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2024-11-13 16:17:58,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 191 transitions. [2024-11-13 16:17:58,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:17:58,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 191 transitions. [2024-11-13 16:17:58,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 191 transitions. [2024-11-13 16:17:58,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2024-11-13 16:17:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 144 states have (on average 1.2916666666666667) internal successors, (186), 143 states have internal predecessors, (186), 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) [2024-11-13 16:17:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2024-11-13 16:17:58,997 INFO L240 hiAutomatonCegarLoop]: Abstraction has 144 states and 186 transitions. [2024-11-13 16:17:58,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-13 16:17:58,999 INFO L424 stractBuchiCegarLoop]: Abstraction has 144 states and 186 transitions. [2024-11-13 16:17:58,999 INFO L331 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-13 16:17:58,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states and 186 transitions. [2024-11-13 16:17:59,000 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 16 [2024-11-13 16:17:59,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:17:59,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:17:59,001 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:17:59,001 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 16:17:59,001 INFO L745 eck$LassoCheckResult]: Stem: 1579#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1565#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1566#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1569#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1570#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1589#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1588#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 1587#L34-2 assume !(main_~i~1#1 < 5); 1586#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1573#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1574#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 1694#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1693#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1691#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1689#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1686#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1684#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1682#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1680#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1678#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1676#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1674#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1670#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1671#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1669#L20-2 assume !(max_~i~0#1 < 5); 1667#L20-3 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1662#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1660#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1659#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1571#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1572#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1653#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1648#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1644#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1640#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 1636#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1632#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1628#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 1624#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1620#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1611#L21-3 [2024-11-13 16:17:59,001 INFO L747 eck$LassoCheckResult]: Loop: 1611#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 1616#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 1610#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1611#L21-3 [2024-11-13 16:17:59,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:17:59,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2058260894, now seen corresponding path program 1 times [2024-11-13 16:17:59,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:17:59,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783608691] [2024-11-13 16:17:59,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:17:59,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:17:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 16:18:01,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783608691] [2024-11-13 16:18:01,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783608691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:18:01,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215458592] [2024-11-13 16:18:01,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:01,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:18:01,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:18:01,696 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:18:01,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2024-11-13 16:18:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:01,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-13 16:18:01,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:18:02,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:18:02,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 18 [2024-11-13 16:18:02,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:18:02,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 15 [2024-11-13 16:18:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 60 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 16:18:02,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:18:03,857 INFO L349 Elim1Store]: treesize reduction 19, result has 80.4 percent of original size [2024-11-13 16:18:03,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 91 [2024-11-13 16:18:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 16:18:03,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215458592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:18:03,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:18:03,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 20] total 57 [2024-11-13 16:18:03,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726937123] [2024-11-13 16:18:03,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:18:03,979 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 16:18:03,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash 77512, now seen corresponding path program 5 times [2024-11-13 16:18:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:03,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070358427] [2024-11-13 16:18:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:03,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:18:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:03,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:18:04,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:04,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-13 16:18:04,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2966, Unknown=0, NotChecked=0, Total=3192 [2024-11-13 16:18:04,053 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. cyclomatic complexity: 52 Second operand has 57 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 57 states have internal predecessors, (90), 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) [2024-11-13 16:18:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:10,344 INFO L93 Difference]: Finished difference Result 285 states and 364 transitions. [2024-11-13 16:18:10,345 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 364 transitions. [2024-11-13 16:18:10,347 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 28 [2024-11-13 16:18:10,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 364 transitions. [2024-11-13 16:18:10,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2024-11-13 16:18:10,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2024-11-13 16:18:10,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 364 transitions. [2024-11-13 16:18:10,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:18:10,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 285 states and 364 transitions. [2024-11-13 16:18:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 364 transitions. [2024-11-13 16:18:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 210. [2024-11-13 16:18:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 209 states have internal predecessors, (271), 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) [2024-11-13 16:18:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 271 transitions. [2024-11-13 16:18:10,366 INFO L240 hiAutomatonCegarLoop]: Abstraction has 210 states and 271 transitions. [2024-11-13 16:18:10,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-11-13 16:18:10,369 INFO L424 stractBuchiCegarLoop]: Abstraction has 210 states and 271 transitions. [2024-11-13 16:18:10,369 INFO L331 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-13 16:18:10,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 271 transitions. [2024-11-13 16:18:10,370 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 16 [2024-11-13 16:18:10,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:18:10,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:18:10,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:18:10,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 16:18:10,372 INFO L745 eck$LassoCheckResult]: Stem: 2407#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 2395#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 2396#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2398#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2399#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2418#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2417#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 2416#L34-2 assume !(main_~i~1#1 < 5); 2415#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2403#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2404#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 2513#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2512#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2511#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 2509#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2507#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2503#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2499#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2497#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2495#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2492#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2490#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2484#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2486#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2483#L20-2 assume !(max_~i~0#1 < 5); 2481#L20-3 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2478#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2475#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2471#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2468#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2464#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2460#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2461#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2459#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2457#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 2453#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2449#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2447#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 2444#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2441#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2437#L21-3 [2024-11-13 16:18:10,372 INFO L747 eck$LassoCheckResult]: Loop: 2437#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 2438#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 2436#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2437#L21-3 [2024-11-13 16:18:10,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:10,373 INFO L85 PathProgramCache]: Analyzing trace with hash 313478368, now seen corresponding path program 2 times [2024-11-13 16:18:10,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:10,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273355504] [2024-11-13 16:18:10,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:10,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 39 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 16:18:11,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:11,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273355504] [2024-11-13 16:18:11,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273355504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:18:11,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039228858] [2024-11-13 16:18:11,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:18:11,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:18:11,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:18:11,386 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:18:11,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-13 16:18:11,537 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:18:11,537 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:18:11,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 16:18:11,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:18:11,564 INFO L378 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 8 treesize of output 1 [2024-11-13 16:18:11,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:18:11,757 INFO L378 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 1 case distinctions, treesize of input 41 treesize of output 18 [2024-11-13 16:18:11,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-13 16:18:11,936 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 16:18:11,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:18:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-13 16:18:12,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039228858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:18:12,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:18:12,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 29 [2024-11-13 16:18:12,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480776803] [2024-11-13 16:18:12,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:18:12,198 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 16:18:12,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:12,198 INFO L85 PathProgramCache]: Analyzing trace with hash 77512, now seen corresponding path program 6 times [2024-11-13 16:18:12,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:12,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324942556] [2024-11-13 16:18:12,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:12,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:12,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:18:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:12,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:18:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:12,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-13 16:18:12,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2024-11-13 16:18:12,281 INFO L87 Difference]: Start difference. First operand 210 states and 271 transitions. cyclomatic complexity: 73 Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 29 states have internal predecessors, (62), 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) [2024-11-13 16:18:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:13,375 INFO L93 Difference]: Finished difference Result 240 states and 305 transitions. [2024-11-13 16:18:13,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 240 states and 305 transitions. [2024-11-13 16:18:13,378 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 19 [2024-11-13 16:18:13,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 240 states to 240 states and 305 transitions. [2024-11-13 16:18:13,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 171 [2024-11-13 16:18:13,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 171 [2024-11-13 16:18:13,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 305 transitions. [2024-11-13 16:18:13,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:18:13,381 INFO L218 hiAutomatonCegarLoop]: Abstraction has 240 states and 305 transitions. [2024-11-13 16:18:13,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 305 transitions. [2024-11-13 16:18:13,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2024-11-13 16:18:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 237 states have (on average 1.2742616033755274) internal successors, (302), 236 states have internal predecessors, (302), 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) [2024-11-13 16:18:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 302 transitions. [2024-11-13 16:18:13,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 237 states and 302 transitions. [2024-11-13 16:18:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 16:18:13,395 INFO L424 stractBuchiCegarLoop]: Abstraction has 237 states and 302 transitions. [2024-11-13 16:18:13,395 INFO L331 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-13 16:18:13,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 237 states and 302 transitions. [2024-11-13 16:18:13,396 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 19 [2024-11-13 16:18:13,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:18:13,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:18:13,397 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:18:13,397 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 16:18:13,397 INFO L745 eck$LassoCheckResult]: Stem: 3157#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 3144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 3145#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 3147#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 3148#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 3167#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 3166#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 3165#L34-2 assume !(main_~i~1#1 < 5); 3164#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 3150#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3151#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 3304#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 3303#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3300#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 3301#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 3365#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3363#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 3362#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 3360#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3357#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 3355#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 3354#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3351#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 3353#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 3350#L20-2 assume !(max_~i~0#1 < 5); 3348#L20-3 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 3346#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 3343#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3327#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 3324#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 3321#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3317#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 3315#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 3313#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3211#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 3207#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 3205#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3203#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 3200#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 3198#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3194#L21-3 [2024-11-13 16:18:13,397 INFO L747 eck$LassoCheckResult]: Loop: 3194#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 3196#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 3193#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3194#L21-3 [2024-11-13 16:18:13,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash 55312930, now seen corresponding path program 3 times [2024-11-13 16:18:13,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:13,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120754503] [2024-11-13 16:18:13,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:13,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 16:18:15,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120754503] [2024-11-13 16:18:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120754503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:18:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109238022] [2024-11-13 16:18:15,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:18:15,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:18:15,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:18:15,390 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:18:15,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2024-11-13 16:18:15,639 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-13 16:18:15,639 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:18:15,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-13 16:18:15,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:18:15,679 INFO L378 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 [2024-11-13 16:18:15,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-13 16:18:16,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:18:16,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 18 [2024-11-13 16:18:16,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:18:16,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 15 [2024-11-13 16:18:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 7 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 16:18:16,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:18:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-13 16:18:18,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109238022] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:18:18,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:18:18,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 19] total 55 [2024-11-13 16:18:18,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037963040] [2024-11-13 16:18:18,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:18:18,137 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 16:18:18,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:18,138 INFO L85 PathProgramCache]: Analyzing trace with hash 77512, now seen corresponding path program 7 times [2024-11-13 16:18:18,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:18,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316972044] [2024-11-13 16:18:18,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:18,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:18,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:18:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:18,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:18:18,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:18,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-13 16:18:18,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2750, Unknown=0, NotChecked=0, Total=2970 [2024-11-13 16:18:18,222 INFO L87 Difference]: Start difference. First operand 237 states and 302 transitions. cyclomatic complexity: 79 Second operand has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 55 states have internal predecessors, (90), 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) [2024-11-13 16:18:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:23,120 INFO L93 Difference]: Finished difference Result 397 states and 497 transitions. [2024-11-13 16:18:23,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 397 states and 497 transitions. [2024-11-13 16:18:23,123 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 31 [2024-11-13 16:18:23,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 397 states to 397 states and 497 transitions. [2024-11-13 16:18:23,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2024-11-13 16:18:23,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 302 [2024-11-13 16:18:23,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 397 states and 497 transitions. [2024-11-13 16:18:23,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:18:23,127 INFO L218 hiAutomatonCegarLoop]: Abstraction has 397 states and 497 transitions. [2024-11-13 16:18:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states and 497 transitions. [2024-11-13 16:18:23,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 303. [2024-11-13 16:18:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 303 states have (on average 1.2640264026402641) internal successors, (383), 302 states have internal predecessors, (383), 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) [2024-11-13 16:18:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 383 transitions. [2024-11-13 16:18:23,147 INFO L240 hiAutomatonCegarLoop]: Abstraction has 303 states and 383 transitions. [2024-11-13 16:18:23,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-13 16:18:23,153 INFO L424 stractBuchiCegarLoop]: Abstraction has 303 states and 383 transitions. [2024-11-13 16:18:23,153 INFO L331 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-13 16:18:23,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 303 states and 383 transitions. [2024-11-13 16:18:23,156 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 19 [2024-11-13 16:18:23,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:18:23,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:18:23,156 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:18:23,156 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 16:18:23,157 INFO L745 eck$LassoCheckResult]: Stem: 4180#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 4165#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 4166#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4169#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4170#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4193#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4192#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4191#L34-2 assume !(main_~i~1#1 < 5); 4190#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 4172#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4173#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 4280#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 4377#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4375#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 4371#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 4369#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4365#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 4363#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 4360#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4355#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 4352#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 4349#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4343#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 4345#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 4342#L20-2 assume !(max_~i~0#1 < 5); 4340#L20-3 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 4337#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 4335#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4333#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 4332#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 4331#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4329#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 4328#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 4327#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4326#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 4323#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 4322#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4321#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 4319#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 4318#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4316#L21-3 [2024-11-13 16:18:23,157 INFO L747 eck$LassoCheckResult]: Loop: 4316#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 4317#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 4315#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4316#L21-3 [2024-11-13 16:18:23,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:23,157 INFO L85 PathProgramCache]: Analyzing trace with hash -233375390, now seen corresponding path program 4 times [2024-11-13 16:18:23,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:23,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021606437] [2024-11-13 16:18:23,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:23,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:18:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:23,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:18:23,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:23,250 INFO L85 PathProgramCache]: Analyzing trace with hash 77512, now seen corresponding path program 8 times [2024-11-13 16:18:23,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:23,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52895047] [2024-11-13 16:18:23,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:23,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:23,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:18:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:23,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:18:23,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1065856455, now seen corresponding path program 5 times [2024-11-13 16:18:23,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:23,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551138356] [2024-11-13 16:18:23,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:23,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-13 16:18:23,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551138356] [2024-11-13 16:18:23,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551138356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:18:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617930962] [2024-11-13 16:18:23,409 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 16:18:23,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:18:23,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:18:23,412 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:18:23,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2024-11-13 16:18:23,564 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-13 16:18:23,564 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:18:23,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 16:18:23,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:18:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-13 16:18:23,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:18:23,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617930962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:18:23,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 16:18:23,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-13 16:18:23,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520317105] [2024-11-13 16:18:23,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:18:23,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:23,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 16:18:23,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-13 16:18:23,681 INFO L87 Difference]: Start difference. First operand 303 states and 383 transitions. cyclomatic complexity: 98 Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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) [2024-11-13 16:18:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:23,846 INFO L93 Difference]: Finished difference Result 318 states and 386 transitions. [2024-11-13 16:18:23,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 386 transitions. [2024-11-13 16:18:23,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 16:18:23,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 286 states and 344 transitions. [2024-11-13 16:18:23,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 191 [2024-11-13 16:18:23,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2024-11-13 16:18:23,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 344 transitions. [2024-11-13 16:18:23,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:18:23,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 286 states and 344 transitions. [2024-11-13 16:18:23,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 344 transitions. [2024-11-13 16:18:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 190. [2024-11-13 16:18:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 190 states have (on average 1.2052631578947368) internal successors, (229), 189 states have internal predecessors, (229), 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) [2024-11-13 16:18:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 229 transitions. [2024-11-13 16:18:23,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 190 states and 229 transitions. [2024-11-13 16:18:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 16:18:23,860 INFO L424 stractBuchiCegarLoop]: Abstraction has 190 states and 229 transitions. [2024-11-13 16:18:23,860 INFO L331 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-13 16:18:23,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 229 transitions. [2024-11-13 16:18:23,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 16:18:23,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:18:23,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:18:23,863 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:18:23,863 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 16:18:23,863 INFO L745 eck$LassoCheckResult]: Stem: 4935#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 4923#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 4924#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4925#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4926#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4944#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4943#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 4942#L34-2 assume !(main_~i~1#1 < 5); 4940#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 4941#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 5027#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 5026#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 5024#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 5021#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 5018#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 5016#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 5013#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 5010#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 5008#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 5005#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 5006#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 5065#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 5063#L21 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 5061#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 5059#L20-2 assume !(max_~i~0#1 < 5); 5057#L20-3 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 5055#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 5053#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 5050#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 5048#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 5046#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 5044#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 5042#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 5040#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4959#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 4956#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 4952#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4951#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 4949#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 4948#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 4947#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 4946#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 4945#L20-6 assume !(max_~i~0#1 < 5); 4939#L20-7 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 4922#max_returnLabel#2 main_#t~ret10#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;call main_#t~mem11#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1;main_~i~2#1 := 0; 4919#L43-2 [2024-11-13 16:18:23,863 INFO L747 eck$LassoCheckResult]: Loop: 4919#L43-2 assume !!(main_~i~2#1 < 4);call main_#t~mem12#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int#1(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 4919#L43-2 [2024-11-13 16:18:23,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1199860473, now seen corresponding path program 1 times [2024-11-13 16:18:23,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:23,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046768545] [2024-11-13 16:18:23,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:23,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:18:26,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:18:26,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046768545] [2024-11-13 16:18:26,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046768545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:18:26,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671048862] [2024-11-13 16:18:26,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:26,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:18:26,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:18:26,257 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:18:26,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-13 16:18:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:18:26,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-13 16:18:26,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:18:26,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:18:26,759 INFO L378 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 1 case distinctions, treesize of input 58 treesize of output 20 [2024-11-13 16:18:26,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 16:18:26,902 INFO L378 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 1 case distinctions, treesize of input 28 treesize of output 12 [2024-11-13 16:18:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-13 16:18:26,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:18:27,411 INFO L349 Elim1Store]: treesize reduction 19, result has 70.3 percent of original size [2024-11-13 16:18:27,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 55 [2024-11-13 16:18:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 29 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-13 16:18:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671048862] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:18:27,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:18:27,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 13, 11] total 42 [2024-11-13 16:18:27,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566737933] [2024-11-13 16:18:27,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:18:27,508 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 16:18:27,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:27,509 INFO L85 PathProgramCache]: Analyzing trace with hash 95, now seen corresponding path program 1 times [2024-11-13 16:18:27,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:27,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23450283] [2024-11-13 16:18:27,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:27,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:27,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:18:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:27,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:18:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:18:27,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-13 16:18:27,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1575, Unknown=0, NotChecked=0, Total=1722 [2024-11-13 16:18:27,601 INFO L87 Difference]: Start difference. First operand 190 states and 229 transitions. cyclomatic complexity: 41 Second operand has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 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) [2024-11-13 16:18:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:18:31,497 INFO L93 Difference]: Finished difference Result 361 states and 423 transitions. [2024-11-13 16:18:31,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 361 states and 423 transitions. [2024-11-13 16:18:31,500 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-11-13 16:18:31,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 361 states to 361 states and 423 transitions. [2024-11-13 16:18:31,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 356 [2024-11-13 16:18:31,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 356 [2024-11-13 16:18:31,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 361 states and 423 transitions. [2024-11-13 16:18:31,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:18:31,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 361 states and 423 transitions. [2024-11-13 16:18:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states and 423 transitions. [2024-11-13 16:18:31,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 277. [2024-11-13 16:18:31,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 277 states have (on average 1.187725631768953) internal successors, (329), 276 states have internal predecessors, (329), 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) [2024-11-13 16:18:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 329 transitions. [2024-11-13 16:18:31,511 INFO L240 hiAutomatonCegarLoop]: Abstraction has 277 states and 329 transitions. [2024-11-13 16:18:31,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-13 16:18:31,512 INFO L424 stractBuchiCegarLoop]: Abstraction has 277 states and 329 transitions. [2024-11-13 16:18:31,513 INFO L331 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-13 16:18:31,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 277 states and 329 transitions. [2024-11-13 16:18:31,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 16:18:31,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 16:18:31,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 16:18:31,516 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:18:31,516 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 16:18:31,516 INFO L745 eck$LassoCheckResult]: Stem: 5881#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 5869#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~post6#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_~i~2#1, main_#t~ret14#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 5870#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 5871#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 5872#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 5889#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 5888#L34-2 assume !!(main_~i~1#1 < 5);havoc main_#t~nondet5#1;call write~int#1(main_#t~nondet5#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet5#1;main_#t~post6#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 5887#L34-2 assume !(main_~i~1#1 < 5); 5885#L34-3 havoc main_~i~1#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 5886#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 5945#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 5944#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 5943#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 5941#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 5942#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 6087#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 6085#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 6086#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 6046#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 6047#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 6080#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 6079#L20-2 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 6077#L21 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 6078#L21-2 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 6130#L20-2 assume !(max_~i~0#1 < 5); 6127#L20-3 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 6124#max_returnLabel#1 main_#t~ret7#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret7#1;havoc main_#t~ret7#1;call main_#t~mem8#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem9#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem9#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 6121#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 6112#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 5873#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 5874#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 5883#L21-3 assume !(max_~ret~0#1 < max_#t~mem1#1);max_#t~ite3#1 := max_~ret~0#1; 6008#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 5993#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 5976#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 5912#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 5914#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 5901#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 5897#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 5895#L20-6 assume !!(max_~i~0#1 < 5);call max_#t~mem1#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 5893#L21-3 assume max_~ret~0#1 < max_#t~mem1#1;call max_#t~mem2#1 := read~int#1(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite3#1 := max_#t~mem2#1; 5891#L21-5 max_~ret~0#1 := max_#t~ite3#1;havoc max_#t~mem1#1;havoc max_#t~ite3#1;havoc max_#t~mem2#1;max_#t~post4#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post4#1;havoc max_#t~post4#1; 5890#L20-6 assume !(max_~i~0#1 < 5); 5884#L20-7 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 5866#max_returnLabel#2 main_#t~ret10#1 := max_#res#1;havoc max_#t~mem1#1, max_#t~ite3#1, max_#t~mem2#1, max_#t~post4#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;havoc max_#in~x#1.base, max_#in~x#1.offset;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;call main_#t~mem11#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem11#1;havoc main_#t~mem11#1;main_~i~2#1 := 0; 5865#L43-2 [2024-11-13 16:18:31,517 INFO L747 eck$LassoCheckResult]: Loop: 5865#L43-2 assume !!(main_~i~2#1 < 4);call main_#t~mem12#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int#1(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 5865#L43-2 [2024-11-13 16:18:31,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:31,517 INFO L85 PathProgramCache]: Analyzing trace with hash -405539389, now seen corresponding path program 1 times [2024-11-13 16:18:31,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:31,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539723608] [2024-11-13 16:18:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:31,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:31,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:18:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:31,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:18:31,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:31,603 INFO L85 PathProgramCache]: Analyzing trace with hash 95, now seen corresponding path program 2 times [2024-11-13 16:18:31,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:31,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181702313] [2024-11-13 16:18:31,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:31,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:18:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:31,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:18:31,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:18:31,611 INFO L85 PathProgramCache]: Analyzing trace with hash 313180893, now seen corresponding path program 1 times [2024-11-13 16:18:31,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:18:31,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500581921] [2024-11-13 16:18:31,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:18:31,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:18:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:31,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:18:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:18:31,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:19:06,668 WARN L286 SmtUtils]: Spent 34.85s on a formula simplification. DAG size of input: 389 DAG size of output: 314 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-13 16:19:17,319 WARN L286 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 248 (called from [L 299] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-13 16:19:17,326 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 16:19:17,326 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 16:19:17,326 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 16:19:17,326 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 16:19:17,326 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-13 16:19:17,326 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:19:17,326 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 16:19:17,326 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 16:19:17,326 INFO L132 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration15_Lasso [2024-11-13 16:19:17,326 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 16:19:17,326 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 16:19:17,351 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:19:17,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,150 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:10,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 16:20:11,066 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 14 [2024-11-13 16:20:11,068 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 14 [2024-11-13 16:20:11,402 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 16:20:11,402 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-13 16:20:11,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:20:11,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:11,406 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:11,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2024-11-13 16:20:11,408 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 [2024-11-13 16:20:11,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:20:11,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 16:20:11,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:20:11,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:20:11,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:20:11,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 16:20:11,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 16:20:11,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:20:11,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-13 16:20:11,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:20:11,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:11,444 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:11,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2024-11-13 16:20:11,448 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 [2024-11-13 16:20:11,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:20:11,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:20:11,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:20:11,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:20:11,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:20:11,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:20:11,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:20:11,488 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-13 16:20:11,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:20:11,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:11,490 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:11,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2024-11-13 16:20:11,492 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 [2024-11-13 16:20:11,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:20:11,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:20:11,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:20:11,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:20:11,505 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:20:11,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:20:11,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:20:11,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-11-13 16:20:11,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:20:11,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:11,526 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:11,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2024-11-13 16:20:11,527 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 [2024-11-13 16:20:11,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:20:11,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:20:11,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:20:11,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:20:11,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:20:11,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:20:11,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:20:11,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-11-13 16:20:11,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:20:11,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:11,558 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:11,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2024-11-13 16:20:11,559 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 [2024-11-13 16:20:11,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:20:11,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:20:11,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:20:11,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:20:11,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:20:11,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:20:11,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:20:11,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-13 16:20:11,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:20:11,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:11,590 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:11,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2024-11-13 16:20:11,591 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 [2024-11-13 16:20:11,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:20:11,602 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-13 16:20:11,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:20:11,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:20:11,606 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-13 16:20:11,606 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:20:11,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:20:11,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-13 16:20:11,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:20:11,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:11,637 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:11,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2024-11-13 16:20:11,639 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 [2024-11-13 16:20:11,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:20:11,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:20:11,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:20:11,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:20:11,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:20:11,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:20:11,657 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:20:11,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-13 16:20:11,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:20:11,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:11,671 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:11,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2024-11-13 16:20:11,673 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 [2024-11-13 16:20:11,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:20:11,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:20:11,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:20:11,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:20:11,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:20:11,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:20:11,689 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:20:11,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2024-11-13 16:20:11,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:20:11,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:11,703 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:11,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2024-11-13 16:20:11,705 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 [2024-11-13 16:20:11,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:20:11,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:20:11,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:20:11,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:20:11,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:20:11,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:20:11,721 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:20:11,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2024-11-13 16:20:11,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:20:11,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:11,735 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:11,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2024-11-13 16:20:11,737 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 [2024-11-13 16:20:11,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:20:11,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:20:11,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:20:11,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:20:11,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:20:11,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:20:11,753 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:20:11,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-11-13 16:20:11,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:20:11,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:11,767 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:11,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2024-11-13 16:20:11,768 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 [2024-11-13 16:20:11,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:20:11,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 16:20:11,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:20:11,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:20:11,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 16:20:11,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:20:11,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 16:20:11,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-13 16:20:11,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:20:11,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:11,800 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:11,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2024-11-13 16:20:11,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 [2024-11-13 16:20:11,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 16:20:11,813 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-13 16:20:11,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 16:20:11,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 16:20:11,820 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-13 16:20:11,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 16:20:11,835 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-13 16:20:11,870 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-11-13 16:20:11,870 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-13 16:20:11,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 16:20:11,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:11,872 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 16:20:11,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2024-11-13 16:20:11,873 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-13 16:20:11,885 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-13 16:20:11,885 INFO L474 LassoAnalysis]: Proved termination. [2024-11-13 16:20:11,885 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2#1, v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_3) = -16*ULTIMATE.start_main_~i~2#1 + 7*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_3 Supporting invariants [] [2024-11-13 16:20:11,898 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2024-11-13 16:20:11,913 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-13 16:20:11,915 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 16:20:11,915 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 16:20:11,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:11,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 16:20:11,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:20:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:12,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:20:12,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:20:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:20:12,060 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-13 16:20:12,060 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 277 states and 329 transitions. cyclomatic complexity: 54 Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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) [2024-11-13 16:20:12,073 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 277 states and 329 transitions. cyclomatic complexity: 54. Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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) Result 278 states and 330 transitions. Complement of second has 2 states. [2024-11-13 16:20:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-13 16:20:12,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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) [2024-11-13 16:20:12,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 20 transitions. [2024-11-13 16:20:12,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 20 transitions. Stem has 45 letters. Loop has 1 letters. [2024-11-13 16:20:12,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 16:20:12,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 20 transitions. Stem has 46 letters. Loop has 1 letters. [2024-11-13 16:20:12,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 16:20:12,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 20 transitions. Stem has 45 letters. Loop has 2 letters. [2024-11-13 16:20:12,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 16:20:12,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 330 transitions. [2024-11-13 16:20:12,078 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-13 16:20:12,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 0 states and 0 transitions. [2024-11-13 16:20:12,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-13 16:20:12,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-13 16:20:12,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-13 16:20:12,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 16:20:12,079 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 16:20:12,079 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 16:20:12,079 INFO L424 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 16:20:12,079 INFO L331 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-13 16:20:12,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-13 16:20:12,079 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-13 16:20:12,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-13 16:20:12,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.11 04:20:12 BoogieIcfgContainer [2024-11-13 16:20:12,089 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-13 16:20:12,090 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:20:12,090 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:20:12,090 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:20:12,091 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:17:47" (3/4) ... [2024-11-13 16:20:12,093 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 16:20:12,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:20:12,095 INFO L158 Benchmark]: Toolchain (without parser) took 145100.56ms. Allocated memory was 117.4MB in the beginning and 981.5MB in the end (delta: 864.0MB). Free memory was 95.0MB in the beginning and 670.9MB in the end (delta: -575.8MB). Peak memory consumption was 290.0MB. Max. memory is 16.1GB. [2024-11-13 16:20:12,095 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:20:12,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 260.67ms. Allocated memory is still 117.4MB. Free memory was 95.0MB in the beginning and 84.0MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:20:12,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.19ms. Allocated memory is still 117.4MB. Free memory was 84.0MB in the beginning and 82.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:20:12,096 INFO L158 Benchmark]: Boogie Preprocessor took 39.95ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 80.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:20:12,097 INFO L158 Benchmark]: RCFGBuilder took 370.12ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 65.6MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:20:12,097 INFO L158 Benchmark]: BuchiAutomizer took 144384.97ms. Allocated memory was 117.4MB in the beginning and 981.5MB in the end (delta: 864.0MB). Free memory was 65.6MB in the beginning and 671.1MB in the end (delta: -605.5MB). Peak memory consumption was 264.8MB. Max. memory is 16.1GB. [2024-11-13 16:20:12,097 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 981.5MB. Free memory was 671.1MB in the beginning and 670.9MB in the end (delta: 207.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:20:12,099 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 142.6MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 260.67ms. Allocated memory is still 117.4MB. Free memory was 95.0MB in the beginning and 84.0MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.19ms. Allocated memory is still 117.4MB. Free memory was 84.0MB in the beginning and 82.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.95ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 80.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 370.12ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 65.6MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 144384.97ms. Allocated memory was 117.4MB in the beginning and 981.5MB in the end (delta: 864.0MB). Free memory was 65.6MB in the beginning and 671.1MB in the end (delta: -605.5MB). Peak memory consumption was 264.8MB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 981.5MB. Free memory was 671.1MB in the beginning and 670.9MB in the end (delta: 207.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (12 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function (9 + ((long long) -2 * i)) and consists of 3 locations. One deterministic module has affine ranking function null and consists of 2 locations. 12 modules have a trivial ranking function, the largest among these consists of 57 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 144.3s and 16 iterations. TraceHistogramMax:5. Analysis of lassos took 125.4s. Construction of modules took 7.9s. Büchi inclusion checks took 10.7s. Highest rank in rank-based complementation 3. Minimization of det autom 15. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 387 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 919 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 916 mSDsluCounter, 1689 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1413 mSDsCounter, 369 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11464 IncrementalHoareTripleChecker+Invalid, 11833 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 369 mSolverCounterUnsat, 276 mSDtfsCounter, 11464 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU11 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital783 mio100 ax100 hnf100 lsp492 ukn41 mio100 lsp144 div100 bol100 ite100 ukn100 eq139 hnf94 smp73 dnf114 smp84 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 9 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-13 16:20:12,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-13 16:20:12,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2024-11-13 16:20:12,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2024-11-13 16:20:12,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2024-11-13 16:20:12,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2024-11-13 16:20:13,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2024-11-13 16:20:13,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2024-11-13 16:20:13,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2024-11-13 16:20:13,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2024-11-13 16:20:13,926 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-13 16:20:14,127 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-13 16:20:14,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeb19f4-661a-4e10-bd43-98244c317b9b/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE