./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-acceleration/array_2-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_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/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_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-acceleration/array_2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/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_29cdafb5-3204-4001-ba3c-5b081e250919/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 d1726b0c52a0be10cb8b374bfde8cdbfe3513d4b934203f7e56a3a1bce5e9e5b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:44:37,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:44:37,141 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 12:44:37,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:44:37,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:44:37,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:44:37,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:44:37,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:44:37,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:44:37,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:44:37,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:44:37,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:44:37,178 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:44:37,178 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 12:44:37,179 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 12:44:37,179 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 12:44:37,179 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 12:44:37,179 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 12:44:37,179 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 12:44:37,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:44:37,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 12:44:37,180 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:44:37,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:44:37,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:44:37,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:44:37,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 12:44:37,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 12:44:37,186 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 12:44:37,186 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:44:37,186 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:44:37,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:44:37,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:44:37,187 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 12:44:37,187 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:44:37,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:44:37,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:44:37,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:44:37,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:44:37,187 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 12:44:37,188 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_29cdafb5-3204-4001-ba3c-5b081e250919/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 -> d1726b0c52a0be10cb8b374bfde8cdbfe3513d4b934203f7e56a3a1bce5e9e5b [2024-11-13 12:44:37,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:44:37,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:44:37,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:44:37,509 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:44:37,509 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:44:37,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/loop-acceleration/array_2-1.i Unable to find full path for "g++" [2024-11-13 12:44:39,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:44:40,020 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:44:40,021 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/sv-benchmarks/c/loop-acceleration/array_2-1.i [2024-11-13 12:44:40,029 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/data/53379b7f5/12f4ffc41327420382a202db70b6430a/FLAGf32d80d46 [2024-11-13 12:44:40,045 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/data/53379b7f5/12f4ffc41327420382a202db70b6430a [2024-11-13 12:44:40,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:44:40,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:44:40,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:40,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:44:40,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:44:40,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f4a959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40, skipping insertion in model container [2024-11-13 12:44:40,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:44:40,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:40,317 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:44:40,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:44:40,369 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:44:40,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40 WrapperNode [2024-11-13 12:44:40,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:44:40,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:40,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:44:40,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:44:40,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,409 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2024-11-13 12:44:40,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:44:40,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:44:40,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:44:40,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:44:40,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,444 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 3, 3]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-11-13 12:44:40,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:44:40,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:44:40,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:44:40,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:44:40,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (1/1) ... [2024-11-13 12:44:40,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:44:40,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:40,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:40,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 12:44:40,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:44:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:44:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 12:44:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 12:44:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 12:44:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 12:44:40,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 12:44:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 12:44:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:44:40,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:44:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 12:44:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 12:44:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 12:44:40,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 12:44:40,693 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:44:40,696 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:44:40,925 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-13 12:44:40,927 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:44:40,939 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:44:40,940 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 12:44:40,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:40 BoogieIcfgContainer [2024-11-13 12:44:40,941 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:44:40,942 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 12:44:40,942 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 12:44:40,948 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 12:44:40,949 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 12:44:40,949 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 12:44:40" (1/3) ... [2024-11-13 12:44:40,951 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63fcad58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 12:44:40, skipping insertion in model container [2024-11-13 12:44:40,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 12:44:40,951 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:44:40" (2/3) ... [2024-11-13 12:44:40,953 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63fcad58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 12:44:40, skipping insertion in model container [2024-11-13 12:44:40,953 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 12:44:40,953 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:44:40" (3/3) ... [2024-11-13 12:44:40,955 INFO L333 chiAutomizerObserver]: Analyzing ICFG array_2-1.i [2024-11-13 12:44:41,037 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 12:44:41,038 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 12:44:41,038 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 12:44:41,038 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 12:44:41,038 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 12:44:41,039 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 12:44:41,039 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 12:44:41,039 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 12:44:41,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 12:44:41,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-11-13 12:44:41,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:44:41,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:44:41,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:44:41,072 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 12:44:41,072 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 12:44:41,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 12:44:41,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2024-11-13 12:44:41,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:44:41,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:44:41,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 12:44:41,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 12:44:41,083 INFO L745 eck$LassoCheckResult]: Stem: 11#$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(12, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 9#L25-2true [2024-11-13 12:44:41,084 INFO L747 eck$LassoCheckResult]: Loop: 9#L25-2true assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 9#L25-2true [2024-11-13 12:44:41,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:41,092 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-13 12:44:41,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:41,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708860047] [2024-11-13 12:44:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:41,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:41,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:44:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:41,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:44:41,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:41,245 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 1 times [2024-11-13 12:44:41,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:41,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508133362] [2024-11-13 12:44:41,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:41,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:41,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:44:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:41,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:44:41,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-11-13 12:44:41,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:41,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442156573] [2024-11-13 12:44:41,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:41,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:41,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:44:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:41,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:44:42,126 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 12:44:42,127 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 12:44:42,127 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 12:44:42,127 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 12:44:42,127 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-13 12:44:42,127 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:44:42,127 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 12:44:42,127 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 12:44:42,128 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_2-1.i_Iteration1_Lasso [2024-11-13 12:44:42,128 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 12:44:42,130 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 12:44:42,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:44:42,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:44:42,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:44:42,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:44:42,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:44:42,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:44:42,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:44:42,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:44:42,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:44:42,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:44:42,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 12:44:43,069 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 12:44:43,074 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-13 12:44:43,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:44:43,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:43,080 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:43,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-13 12:44:43,083 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 12:44:43,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:44:43,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:44:43,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:44:43,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:44:43,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:44:43,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:44:43,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:44:43,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-13 12:44:43,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:44:43,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:43,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:43,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-13 12:44:43,148 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 12:44:43,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:44:43,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:44:43,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:44:43,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:44:43,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:44:43,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:44:43,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:44:43,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-13 12:44:43,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:44:43,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:43,202 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:43,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-13 12:44:43,205 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 12:44:43,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:44:43,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:44:43,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:44:43,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:44:43,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:44:43,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:44:43,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:44:43,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:44:43,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-13 12:44:43,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:44:43,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:43,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:43,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-13 12:44:43,261 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 12:44:43,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:44:43,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:44:43,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:44:43,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:44:43,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:44:43,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:44:43,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:44:43,285 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:44:43,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-13 12:44:43,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:44:43,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:43,312 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:43,317 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 12:44:43,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-13 12:44:43,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:44:43,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:44:43,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:44:43,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:44:43,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:44:43,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:44:43,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:44:43,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:44:43,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-13 12:44:43,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:44:43,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:43,354 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:43,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-13 12:44:43,357 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 12:44:43,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:44:43,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 12:44:43,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:44:43,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:44:43,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:44:43,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 12:44:43,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 12:44:43,375 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:44:43,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-13 12:44:43,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:44:43,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:43,393 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:43,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-13 12:44:43,398 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 12:44:43,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:44:43,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:44:43,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:44:43,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:44:43,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:44:43,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:44:43,425 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:44:43,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-13 12:44:43,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:44:43,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:43,449 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:43,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-13 12:44:43,453 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 12:44:43,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:44:43,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:44:43,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:44:43,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:44:43,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:44:43,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:44:43,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 12:44:43,503 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-13 12:44:43,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:44:43,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:43,506 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:43,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-13 12:44:43,511 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 12:44:43,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 12:44:43,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 12:44:43,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 12:44:43,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 12:44:43,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 12:44:43,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 12:44:43,557 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-13 12:44:43,645 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2024-11-13 12:44:43,649 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-11-13 12:44:43,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 12:44:43,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:43,655 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 12:44:43,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-13 12:44:43,658 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-13 12:44:43,677 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-13 12:44:43,677 INFO L474 LassoAnalysis]: Proved termination. [2024-11-13 12:44:43,678 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 4095*v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-13 12:44:43,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-13 12:44:43,756 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-13 12:44:43,766 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 12:44:43,767 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 12:44:43,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:43,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 12:44:43,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:43,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 12:44:43,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:43,883 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 12:44:43,922 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 12:44:43,925 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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) 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 12:44:43,976 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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). 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 26 states and 36 transitions. Complement of second has 4 states. [2024-11-13 12:44:43,979 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 12:44:43,986 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 12:44:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2024-11-13 12:44:44,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 2 letters. Loop has 1 letters. [2024-11-13 12:44:44,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 12:44:44,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 3 letters. Loop has 1 letters. [2024-11-13 12:44:44,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 12:44:44,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-13 12:44:44,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 12:44:44,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 36 transitions. [2024-11-13 12:44:44,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 12:44:44,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 6 states and 8 transitions. [2024-11-13 12:44:44,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2024-11-13 12:44:44,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2024-11-13 12:44:44,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 8 transitions. [2024-11-13 12:44:44,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:44:44,016 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2024-11-13 12:44:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 8 transitions. [2024-11-13 12:44:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2024-11-13 12:44:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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 12:44:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2024-11-13 12:44:44,048 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2024-11-13 12:44:44,049 INFO L424 stractBuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2024-11-13 12:44:44,049 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 12:44:44,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2024-11-13 12:44:44,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 12:44:44,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:44:44,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:44:44,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-13 12:44:44,051 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 12:44:44,051 INFO L745 eck$LassoCheckResult]: Stem: 105#$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(12, 2); 106#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 101#L25-2 assume !(main_~i~0#1 < 2048); 102#L25-3 main_~i~0#1 := 0; 104#L29-2 [2024-11-13 12:44:44,051 INFO L747 eck$LassoCheckResult]: Loop: 104#L29-2 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 104#L29-2 [2024-11-13 12:44:44,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:44,052 INFO L85 PathProgramCache]: Analyzing trace with hash 925705, now seen corresponding path program 1 times [2024-11-13 12:44:44,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:44,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995143367] [2024-11-13 12:44:44,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,174 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 12:44:44,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:44,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995143367] [2024-11-13 12:44:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995143367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:44:44,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:44:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:44:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123999532] [2024-11-13 12:44:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:44:44,179 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 12:44:44,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:44,179 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 1 times [2024-11-13 12:44:44,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:44,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922468146] [2024-11-13 12:44:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:44,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:44,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:44:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:44,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:44:44,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:44,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:44:44,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:44:44,345 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. cyclomatic complexity: 4 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 12:44:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:44,368 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2024-11-13 12:44:44,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2024-11-13 12:44:44,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 12:44:44,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2024-11-13 12:44:44,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-11-13 12:44:44,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-13 12:44:44,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2024-11-13 12:44:44,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:44:44,370 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-11-13 12:44:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2024-11-13 12:44:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2024-11-13 12:44:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:44:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2024-11-13 12:44:44,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-13 12:44:44,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:44:44,376 INFO L424 stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2024-11-13 12:44:44,376 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 12:44:44,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2024-11-13 12:44:44,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 12:44:44,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:44:44,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:44:44,377 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-13 12:44:44,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 12:44:44,377 INFO L745 eck$LassoCheckResult]: Stem: 124#$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(12, 2); 125#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 120#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 121#L25-2 assume !(main_~i~0#1 < 2048); 122#L25-3 main_~i~0#1 := 0; 123#L29-2 [2024-11-13 12:44:44,377 INFO L747 eck$LassoCheckResult]: Loop: 123#L29-2 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 123#L29-2 [2024-11-13 12:44:44,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash 28698605, now seen corresponding path program 1 times [2024-11-13 12:44:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:44,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790328695] [2024-11-13 12:44:44,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:44,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,510 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 12:44:44,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:44,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790328695] [2024-11-13 12:44:44,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790328695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:44,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14419238] [2024-11-13 12:44:44,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:44,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:44,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:44,513 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:44,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 12:44:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:44,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 12:44:44,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:44,603 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 12:44:44,603 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:44,631 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 12:44:44,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14419238] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:44,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:44,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-13 12:44:44,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267209490] [2024-11-13 12:44:44,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:44,632 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 12:44:44,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:44,633 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 2 times [2024-11-13 12:44:44,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:44,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676429667] [2024-11-13 12:44:44,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:44,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:44,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:44:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:44,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:44:44,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:44,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 12:44:44,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:44:44,760 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 3 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 12:44:44,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-13 12:44:44,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:44,819 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2024-11-13 12:44:44,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2024-11-13 12:44:44,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 12:44:44,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2024-11-13 12:44:44,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-11-13 12:44:44,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-11-13 12:44:44,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2024-11-13 12:44:44,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:44:44,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-13 12:44:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2024-11-13 12:44:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2024-11-13 12:44:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) 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 12:44:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-13 12:44:44,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-13 12:44:44,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:44:44,824 INFO L424 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-13 12:44:44,824 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 12:44:44,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2024-11-13 12:44:44,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 12:44:44,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:44:44,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:44:44,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1] [2024-11-13 12:44:44,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 12:44:44,826 INFO L745 eck$LassoCheckResult]: Stem: 178#$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(12, 2); 179#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 173#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 174#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 175#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 181#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 180#L25-2 assume !(main_~i~0#1 < 2048); 176#L25-3 main_~i~0#1 := 0; 177#L29-2 [2024-11-13 12:44:44,826 INFO L747 eck$LassoCheckResult]: Loop: 177#L29-2 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 177#L29-2 [2024-11-13 12:44:44,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash 263387401, now seen corresponding path program 2 times [2024-11-13 12:44:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:44,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023458837] [2024-11-13 12:44:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:44,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:45,095 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 12:44:45,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:45,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023458837] [2024-11-13 12:44:45,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023458837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:45,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736119775] [2024-11-13 12:44:45,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:44:45,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:45,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:45,098 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:45,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 12:44:45,212 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:44:45,212 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:44:45,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 12:44:45,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:45,244 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 12:44:45,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:45,338 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 12:44:45,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736119775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:45,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:45,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-13 12:44:45,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442587440] [2024-11-13 12:44:45,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:45,339 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 12:44:45,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:45,340 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 3 times [2024-11-13 12:44:45,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:45,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629891662] [2024-11-13 12:44:45,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:45,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:45,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:44:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:45,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:44:45,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:45,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:44:45,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:44:45,468 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:44:45,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:45,545 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-11-13 12:44:45,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2024-11-13 12:44:45,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 12:44:45,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2024-11-13 12:44:45,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-13 12:44:45,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-13 12:44:45,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2024-11-13 12:44:45,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:44:45,548 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-13 12:44:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2024-11-13 12:44:45,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2024-11-13 12:44:45,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:44:45,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-13 12:44:45,553 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-13 12:44:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:44:45,556 INFO L424 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-13 12:44:45,556 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 12:44:45,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2024-11-13 12:44:45,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 12:44:45,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:44:45,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:44:45,557 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1] [2024-11-13 12:44:45,558 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 12:44:45,558 INFO L745 eck$LassoCheckResult]: Stem: 270#$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(12, 2); 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 265#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 266#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 267#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 279#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 278#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 277#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 276#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 275#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 274#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 273#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 272#L25-2 assume !(main_~i~0#1 < 2048); 268#L25-3 main_~i~0#1 := 0; 269#L29-2 [2024-11-13 12:44:45,558 INFO L747 eck$LassoCheckResult]: Loop: 269#L29-2 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 269#L29-2 [2024-11-13 12:44:45,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:45,558 INFO L85 PathProgramCache]: Analyzing trace with hash -608711031, now seen corresponding path program 3 times [2024-11-13 12:44:45,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:45,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601315520] [2024-11-13 12:44:45,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:45,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:44:46,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:46,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601315520] [2024-11-13 12:44:46,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601315520] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:46,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025398943] [2024-11-13 12:44:46,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:44:46,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:46,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:46,190 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:46,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 12:44:46,766 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-13 12:44:46,766 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:44:46,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 12:44:46,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:46,849 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:44:46,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:44:47,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025398943] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:47,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:47,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-13 12:44:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834688857] [2024-11-13 12:44:47,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:47,220 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 12:44:47,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:47,221 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 4 times [2024-11-13 12:44:47,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:47,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14427684] [2024-11-13 12:44:47,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:47,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:47,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:44:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:47,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:44:47,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:47,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 12:44:47,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-13 12:44:47,361 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 25 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 12:44:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:47,537 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2024-11-13 12:44:47,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2024-11-13 12:44:47,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 12:44:47,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 50 transitions. [2024-11-13 12:44:47,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-13 12:44:47,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-11-13 12:44:47,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 50 transitions. [2024-11-13 12:44:47,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:44:47,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 50 transitions. [2024-11-13 12:44:47,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 50 transitions. [2024-11-13 12:44:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2024-11-13 12:44:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.037037037037037) internal successors, (28), 26 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 12:44:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-13 12:44:47,551 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-13 12:44:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 12:44:47,553 INFO L424 stractBuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-13 12:44:47,553 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 12:44:47,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2024-11-13 12:44:47,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 12:44:47,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:44:47,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:44:47,554 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 1, 1, 1, 1] [2024-11-13 12:44:47,555 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 12:44:47,555 INFO L745 eck$LassoCheckResult]: Stem: 440#$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(12, 2); 441#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 435#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 436#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 437#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 461#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 460#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 459#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 458#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 457#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 456#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 455#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 454#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 453#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 452#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 451#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 450#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 449#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 448#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 447#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 446#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 445#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 444#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 443#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 442#L25-2 assume !(main_~i~0#1 < 2048); 438#L25-3 main_~i~0#1 := 0; 439#L29-2 [2024-11-13 12:44:47,558 INFO L747 eck$LassoCheckResult]: Loop: 439#L29-2 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 439#L29-2 [2024-11-13 12:44:47,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:47,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1021896311, now seen corresponding path program 4 times [2024-11-13 12:44:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:47,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418137628] [2024-11-13 12:44:47,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:47,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:44:48,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:48,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418137628] [2024-11-13 12:44:48,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418137628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:48,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965333992] [2024-11-13 12:44:48,698 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 12:44:48,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:48,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:48,700 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:48,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 12:44:48,900 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 12:44:48,901 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:44:48,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 12:44:48,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:44:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:44:49,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:44:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:44:50,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965333992] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:44:50,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:44:50,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-13 12:44:50,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566777017] [2024-11-13 12:44:50,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:44:50,119 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 12:44:50,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:50,119 INFO L85 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 5 times [2024-11-13 12:44:50,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:50,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102087217] [2024-11-13 12:44:50,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:50,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:50,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:44:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:44:50,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:44:50,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:44:50,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-13 12:44:50,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-13 12:44:50,245 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:44:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:44:50,640 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2024-11-13 12:44:50,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 98 transitions. [2024-11-13 12:44:50,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 12:44:50,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 97 states and 98 transitions. [2024-11-13 12:44:50,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-13 12:44:50,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-13 12:44:50,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 98 transitions. [2024-11-13 12:44:50,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 12:44:50,651 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 98 transitions. [2024-11-13 12:44:50,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 98 transitions. [2024-11-13 12:44:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 51. [2024-11-13 12:44:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:44:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2024-11-13 12:44:50,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-11-13 12:44:50,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-13 12:44:50,667 INFO L424 stractBuchiCegarLoop]: Abstraction has 51 states and 52 transitions. [2024-11-13 12:44:50,671 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 12:44:50,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 52 transitions. [2024-11-13 12:44:50,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-11-13 12:44:50,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 12:44:50,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 12:44:50,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 1, 1, 1, 1] [2024-11-13 12:44:50,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 12:44:50,678 INFO L745 eck$LassoCheckResult]: Stem: 766#$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(12, 2); 767#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~post3#1, main_#t~mem4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; 761#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 762#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 763#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 811#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 810#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 809#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 808#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 807#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 806#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 805#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 804#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 803#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 802#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 801#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 800#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 799#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 798#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 797#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 796#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 795#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 794#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 793#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 792#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 791#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 790#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 789#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 788#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 787#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 786#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 785#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 784#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 783#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 782#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 781#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 780#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 779#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 778#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 777#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 776#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 775#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 774#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 773#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 772#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 771#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 770#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 769#L25-2 assume !!(main_~i~0#1 < 2048);havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;havoc main_#t~nondet2#1;call write~int#1(main_#t~nondet2#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1;main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 768#L25-2 assume !(main_~i~0#1 < 2048); 764#L25-3 main_~i~0#1 := 0; 765#L29-2 [2024-11-13 12:44:50,679 INFO L747 eck$LassoCheckResult]: Loop: 765#L29-2 assume !!(main_~i~0#1 < 2048);call main_#t~mem4#1 := read~int#2(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem4#1;havoc main_#t~mem4#1;call write~int#1(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 765#L29-2 [2024-11-13 12:44:50,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:44:50,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1748226167, now seen corresponding path program 5 times [2024-11-13 12:44:50,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:44:50,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088217032] [2024-11-13 12:44:50,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:44:50,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:44:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:44:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:44:54,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:44:54,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088217032] [2024-11-13 12:44:54,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088217032] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:44:54,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659408057] [2024-11-13 12:44:54,169 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 12:44:54,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:44:54,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:44:54,171 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:44:54,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29cdafb5-3204-4001-ba3c-5b081e250919/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process