./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loop-acceleration/array_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loop-acceleration/array_4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX --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 e8c27e61ac5d5a22c0e00a5dbac1b872460567877a501387ed9d5bda89096498 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:57:07,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:57:07,971 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-08 18:57:07,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:57:07,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:57:08,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:57:08,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:57:08,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:57:08,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:57:08,014 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:57:08,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:57:08,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:57:08,015 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:57:08,016 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-08 18:57:08,018 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-08 18:57:08,018 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-08 18:57:08,019 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-08 18:57:08,019 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-08 18:57:08,019 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-08 18:57:08,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:57:08,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-08 18:57:08,024 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:57:08,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:57:08,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:57:08,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:57:08,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-08 18:57:08,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-08 18:57:08,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-08 18:57:08,026 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:57:08,026 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 18:57:08,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:57:08,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:57:08,027 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-08 18:57:08,030 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:57:08,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:57:08,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:57:08,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:57:08,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:57:08,032 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-08 18:57:08,032 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX 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 -> e8c27e61ac5d5a22c0e00a5dbac1b872460567877a501387ed9d5bda89096498 [2024-11-08 18:57:08,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:57:08,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:57:08,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:57:08,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:57:08,369 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:57:08,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/loop-acceleration/array_4.i Unable to find full path for "g++" [2024-11-08 18:57:10,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:57:10,586 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:57:10,586 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/sv-benchmarks/c/loop-acceleration/array_4.i [2024-11-08 18:57:10,594 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/data/0c47f67f1/b68e6cb8321d41eebf584069cc17c56a/FLAG6ec488108 [2024-11-08 18:57:10,933 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/data/0c47f67f1/b68e6cb8321d41eebf584069cc17c56a [2024-11-08 18:57:10,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:57:10,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:57:10,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:57:10,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:57:10,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:57:10,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:57:10" (1/1) ... [2024-11-08 18:57:10,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15d6b67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:10, skipping insertion in model container [2024-11-08 18:57:10,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:57:10" (1/1) ... [2024-11-08 18:57:10,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:57:11,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:57:11,160 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:57:11,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:57:11,195 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:57:11,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11 WrapperNode [2024-11-08 18:57:11,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:57:11,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:57:11,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:57:11,198 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:57:11,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11" (1/1) ... [2024-11-08 18:57:11,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11" (1/1) ... [2024-11-08 18:57:11,231 INFO L138 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2024-11-08 18:57:11,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:57:11,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:57:11,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:57:11,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:57:11,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11" (1/1) ... [2024-11-08 18:57:11,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11" (1/1) ... [2024-11-08 18:57:11,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11" (1/1) ... [2024-11-08 18:57:11,268 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-08 18:57:11,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11" (1/1) ... [2024-11-08 18:57:11,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11" (1/1) ... [2024-11-08 18:57:11,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11" (1/1) ... [2024-11-08 18:57:11,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11" (1/1) ... [2024-11-08 18:57:11,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11" (1/1) ... [2024-11-08 18:57:11,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11" (1/1) ... [2024-11-08 18:57:11,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:57:11,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:57:11,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:57:11,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:57:11,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11" (1/1) ... [2024-11-08 18:57:11,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:11,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:11,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:11,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-08 18:57:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:57:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:57:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 18:57:11,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 18:57:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 18:57:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 18:57:11,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:57:11,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:57:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 18:57:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 18:57:11,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 18:57:11,429 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:57:11,432 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:57:11,618 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 18:57:11,620 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:57:11,630 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:57:11,630 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:57:11,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:57:11 BoogieIcfgContainer [2024-11-08 18:57:11,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:57:11,632 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-08 18:57:11,632 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-08 18:57:11,637 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-08 18:57:11,637 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 18:57:11,638 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 06:57:10" (1/3) ... [2024-11-08 18:57:11,639 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66998c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 06:57:11, skipping insertion in model container [2024-11-08 18:57:11,639 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 18:57:11,639 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:57:11" (2/3) ... [2024-11-08 18:57:11,640 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66998c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 06:57:11, skipping insertion in model container [2024-11-08 18:57:11,640 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-08 18:57:11,640 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:57:11" (3/3) ... [2024-11-08 18:57:11,642 INFO L332 chiAutomizerObserver]: Analyzing ICFG array_4.i [2024-11-08 18:57:11,704 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-08 18:57:11,704 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-08 18:57:11,704 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-08 18:57:11,705 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-08 18:57:11,705 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-08 18:57:11,705 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-08 18:57:11,705 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-08 18:57:11,706 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-08 18:57:11,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:57:11,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-08 18:57:11,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:57:11,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:57:11,734 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 18:57:11,735 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:57:11,735 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-08 18:57:11,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:57:11,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2024-11-08 18:57:11,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:57:11,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:57:11,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-08 18:57:11,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:57:11,745 INFO L745 eck$LassoCheckResult]: Stem: 12#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 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~post2#1, main_#t~mem3#1, main_#t~post4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 5#L25-3true [2024-11-08 18:57:11,746 INFO L747 eck$LassoCheckResult]: Loop: 5#L25-3true assume main_~i~0#1 < 1023; 6#L25-1true assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5#L25-3true [2024-11-08 18:57:11,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:11,752 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-08 18:57:11,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:11,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418733143] [2024-11-08 18:57:11,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:11,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:57:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:11,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:57:11,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:11,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1158, now seen corresponding path program 1 times [2024-11-08 18:57:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:11,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982943727] [2024-11-08 18:57:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:11,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:11,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:57:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:11,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:57:11,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:11,967 INFO L85 PathProgramCache]: Analyzing trace with hash 925640, now seen corresponding path program 1 times [2024-11-08 18:57:11,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:11,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221955949] [2024-11-08 18:57:11,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:11,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:12,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:57:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:12,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:57:12,600 INFO L204 LassoAnalysis]: Preferences: [2024-11-08 18:57:12,601 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-08 18:57:12,601 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-08 18:57:12,601 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-08 18:57:12,601 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-08 18:57:12,602 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:12,602 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-08 18:57:12,603 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-08 18:57:12,603 INFO L132 ssoRankerPreferences]: Filename of dumped script: array_4.i_Iteration1_Lasso [2024-11-08 18:57:12,604 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-08 18:57:12,605 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-08 18:57:12,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:57:12,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:57:12,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:57:12,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:57:12,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:57:12,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:57:12,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-08 18:57:13,174 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-08 18:57:13,179 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-08 18:57:13,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,184 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-08 18:57:13,187 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-08 18:57:13,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 18:57:13,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 18:57:13,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 18:57:13,210 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-08 18:57:13,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-08 18:57:13,239 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-08 18:57:13,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:57:13,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:57:13,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-08 18:57:13,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-08 18:57:13,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-08 18:57:13,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:57:13,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:57:13,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-08 18:57:13,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,336 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-08 18:57:13,338 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-08 18:57:13,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 18:57:13,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 18:57:13,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 18:57:13,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-08 18:57:13,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,378 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-08 18:57:13,382 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-08 18:57:13,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 18:57:13,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 18:57:13,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 18:57:13,415 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-08 18:57:13,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,441 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-08 18:57:13,446 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-08 18:57:13,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 18:57:13,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 18:57:13,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 18:57:13,469 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-11-08 18:57:13,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,491 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-08 18:57:13,494 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-08 18:57:13,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-08 18:57:13,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-08 18:57:13,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-08 18:57:13,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-08 18:57:13,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,535 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-08 18:57:13,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-08 18:57:13,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:57:13,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:57:13,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-08 18:57:13,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,589 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-08 18:57:13,592 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-08 18:57:13,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:57:13,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:57:13,615 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-08 18:57:13,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,636 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-08 18:57:13,643 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-08 18:57:13,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:57:13,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:57:13,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-08 18:57:13,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,687 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-08 18:57:13,689 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-08 18:57:13,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:57:13,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:57:13,714 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-08 18:57:13,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,735 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-08 18:57:13,738 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-08 18:57:13,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:57:13,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:57:13,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-08 18:57:13,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,806 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-08 18:57:13,815 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-08 18:57:13,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:57:13,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:57:13,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-08 18:57:13,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,928 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-08 18:57:13,933 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-08 18:57:13,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:13,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:13,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:13,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:13,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:57:13,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:57:13,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-08 18:57:13,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-08 18:57:13,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:13,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:13,988 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:13,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-08 18:57:13,990 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-08 18:57:14,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-08 18:57:14,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-08 18:57:14,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-08 18:57:14,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-08 18:57:14,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-08 18:57:14,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-08 18:57:14,020 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-08 18:57:14,067 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-08 18:57:14,068 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-08 18:57:14,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-08 18:57:14,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:14,083 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-08 18:57:14,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-08 18:57:14,086 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-08 18:57:14,110 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-08 18:57:14,110 INFO L474 LassoAnalysis]: Proved termination. [2024-11-08 18:57:14,110 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1) = -8*ULTIMATE.start_main_~i~0#1 + 2045*v_rep(select #length ULTIMATE.start_main_~#A~0#1.base)_1 Supporting invariants [] [2024-11-08 18:57:14,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-08 18:57:14,150 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-08 18:57:14,163 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-08 18:57:14,165 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-08 18:57:14,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:14,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 18:57:14,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:57:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:14,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:57:14,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:57:14,254 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-08 18:57:14,288 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-08 18:57:14,290 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-08 18:57:14,339 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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) Result 30 states and 40 transitions. Complement of second has 6 states. [2024-11-08 18:57:14,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-08 18:57:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 18:57:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2024-11-08 18:57:14,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-08 18:57:14,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 18:57:14,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-08 18:57:14,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 18:57:14,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-08 18:57:14,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-08 18:57:14,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2024-11-08 18:57:14,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:14,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 8 states and 10 transitions. [2024-11-08 18:57:14,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2024-11-08 18:57:14,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2024-11-08 18:57:14,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2024-11-08 18:57:14,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 18:57:14,358 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-11-08 18:57:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2024-11-08 18:57:14,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-08 18:57:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) 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-08 18:57:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2024-11-08 18:57:14,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-11-08 18:57:14,384 INFO L425 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2024-11-08 18:57:14,384 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-08 18:57:14,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2024-11-08 18:57:14,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:14,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:57:14,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:57:14,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-08 18:57:14,386 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:57:14,386 INFO L745 eck$LassoCheckResult]: Stem: 104#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~post4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 100#L25-3 assume !(main_~i~0#1 < 1023); 102#L25-4 call write~int#1(0, main_~#A~0#1.base, 4092 + main_~#A~0#1.offset, 4);main_~i~0#1 := 0; 99#L30-3 [2024-11-08 18:57:14,386 INFO L747 eck$LassoCheckResult]: Loop: 99#L30-3 call main_#t~mem3#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4); 98#L30-1 assume !!(0 != main_#t~mem3#1);havoc main_#t~mem3#1;main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 99#L30-3 [2024-11-08 18:57:14,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash 925861, now seen corresponding path program 1 times [2024-11-08 18:57:14,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:14,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803719915] [2024-11-08 18:57:14,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:14,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:14,482 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-08 18:57:14,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:14,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803719915] [2024-11-08 18:57:14,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803719915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:57:14,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:57:14,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:57:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464646990] [2024-11-08 18:57:14,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:57:14,488 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 18:57:14,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 1 times [2024-11-08 18:57:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:14,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664908837] [2024-11-08 18:57:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:14,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:14,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:57:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:14,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:57:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:14,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:57:14,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:57:14,562 INFO L87 Difference]: Start difference. First operand 8 states and 10 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-08 18:57:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:14,583 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2024-11-08 18:57:14,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2024-11-08 18:57:14,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:14,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2024-11-08 18:57:14,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-11-08 18:57:14,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-11-08 18:57:14,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2024-11-08 18:57:14,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 18:57:14,584 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-08 18:57:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2024-11-08 18:57:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2024-11-08 18:57:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 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-08 18:57:14,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2024-11-08 18:57:14,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-11-08 18:57:14,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:57:14,588 INFO L425 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-11-08 18:57:14,588 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-08 18:57:14,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2024-11-08 18:57:14,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:14,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:57:14,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:57:14,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-08 18:57:14,590 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:57:14,591 INFO L745 eck$LassoCheckResult]: Stem: 129#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~post4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 125#L25-3 assume main_~i~0#1 < 1023; 126#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 127#L25-3 assume !(main_~i~0#1 < 1023); 128#L25-4 call write~int#1(0, main_~#A~0#1.base, 4092 + main_~#A~0#1.offset, 4);main_~i~0#1 := 0; 124#L30-3 [2024-11-08 18:57:14,591 INFO L747 eck$LassoCheckResult]: Loop: 124#L30-3 call main_#t~mem3#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4); 123#L30-1 assume !!(0 != main_#t~mem3#1);havoc main_#t~mem3#1;main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 124#L30-3 [2024-11-08 18:57:14,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash 889540458, now seen corresponding path program 1 times [2024-11-08 18:57:14,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:14,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430447093] [2024-11-08 18:57:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:14,696 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-08 18:57:14,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:14,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430447093] [2024-11-08 18:57:14,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430447093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:57:14,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913556897] [2024-11-08 18:57:14,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:14,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:57:14,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:14,699 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:57:14,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 18:57:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:14,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 18:57:14,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:57:14,783 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-08 18:57:14,783 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:57:14,811 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-08 18:57:14,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913556897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:57:14,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:57:14,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-08 18:57:14,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556363009] [2024-11-08 18:57:14,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:57:14,813 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 18:57:14,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:14,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 2 times [2024-11-08 18:57:14,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:14,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313765690] [2024-11-08 18:57:14,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:14,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:14,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:57:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:14,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:57:14,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:14,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:57:14,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:57:14,883 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:57:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:14,935 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-08 18:57:14,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 23 transitions. [2024-11-08 18:57:14,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:14,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 23 transitions. [2024-11-08 18:57:14,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-11-08 18:57:14,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-11-08 18:57:14,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 23 transitions. [2024-11-08 18:57:14,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 18:57:14,938 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-08 18:57:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 23 transitions. [2024-11-08 18:57:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2024-11-08 18:57:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:57:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-08 18:57:14,940 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-08 18:57:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:57:14,941 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-08 18:57:14,941 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-08 18:57:14,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2024-11-08 18:57:14,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:14,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:57:14,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:57:14,943 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2024-11-08 18:57:14,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:57:14,943 INFO L745 eck$LassoCheckResult]: Stem: 200#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 201#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~post4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 195#L25-3 assume main_~i~0#1 < 1023; 196#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 197#L25-3 assume main_~i~0#1 < 1023; 198#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 202#L25-3 assume main_~i~0#1 < 1023; 206#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 205#L25-3 assume main_~i~0#1 < 1023; 204#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 203#L25-3 assume !(main_~i~0#1 < 1023); 199#L25-4 call write~int#1(0, main_~#A~0#1.base, 4092 + main_~#A~0#1.offset, 4);main_~i~0#1 := 0; 194#L30-3 [2024-11-08 18:57:14,943 INFO L747 eck$LassoCheckResult]: Loop: 194#L30-3 call main_#t~mem3#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4); 193#L30-1 assume !!(0 != main_#t~mem3#1);havoc main_#t~mem3#1;main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 194#L30-3 [2024-11-08 18:57:14,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash -251892679, now seen corresponding path program 2 times [2024-11-08 18:57:14,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:14,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983614727] [2024-11-08 18:57:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:57:15,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:15,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983614727] [2024-11-08 18:57:15,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983614727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:57:15,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285550188] [2024-11-08 18:57:15,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:57:15,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:57:15,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:15,084 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:57:15,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 18:57:15,157 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:57:15,157 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:57:15,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 18:57:15,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:57:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:57:15,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:57:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:57:15,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285550188] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:57:15,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:57:15,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-08 18:57:15,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969782539] [2024-11-08 18:57:15,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:57:15,295 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 18:57:15,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 3 times [2024-11-08 18:57:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:15,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523140308] [2024-11-08 18:57:15,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:15,302 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:57:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:15,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:57:15,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:15,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:57:15,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:57:15,364 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:57:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:15,489 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-11-08 18:57:15,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 47 transitions. [2024-11-08 18:57:15,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:15,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 47 transitions. [2024-11-08 18:57:15,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-08 18:57:15,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2024-11-08 18:57:15,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 47 transitions. [2024-11-08 18:57:15,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 18:57:15,495 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 47 transitions. [2024-11-08 18:57:15,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 47 transitions. [2024-11-08 18:57:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2024-11-08 18:57:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:57:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-11-08 18:57:15,498 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-11-08 18:57:15,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:57:15,501 INFO L425 stractBuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-11-08 18:57:15,501 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-08 18:57:15,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2024-11-08 18:57:15,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:15,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:57:15,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:57:15,503 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2024-11-08 18:57:15,503 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:57:15,503 INFO L745 eck$LassoCheckResult]: Stem: 342#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~post4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 337#L25-3 assume main_~i~0#1 < 1023; 338#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 339#L25-3 assume main_~i~0#1 < 1023; 340#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 344#L25-3 assume main_~i~0#1 < 1023; 360#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 359#L25-3 assume main_~i~0#1 < 1023; 358#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 357#L25-3 assume main_~i~0#1 < 1023; 356#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 355#L25-3 assume main_~i~0#1 < 1023; 354#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 353#L25-3 assume main_~i~0#1 < 1023; 352#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 351#L25-3 assume main_~i~0#1 < 1023; 350#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 349#L25-3 assume main_~i~0#1 < 1023; 348#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 347#L25-3 assume main_~i~0#1 < 1023; 346#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 345#L25-3 assume !(main_~i~0#1 < 1023); 341#L25-4 call write~int#1(0, main_~#A~0#1.base, 4092 + main_~#A~0#1.offset, 4);main_~i~0#1 := 0; 336#L30-3 [2024-11-08 18:57:15,503 INFO L747 eck$LassoCheckResult]: Loop: 336#L30-3 call main_#t~mem3#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4); 335#L30-1 assume !!(0 != main_#t~mem3#1);havoc main_#t~mem3#1;main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 336#L30-3 [2024-11-08 18:57:15,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:15,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1048039447, now seen corresponding path program 3 times [2024-11-08 18:57:15,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:15,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210457906] [2024-11-08 18:57:15,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:15,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:15,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-08 18:57:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:57:15,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:15,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210457906] [2024-11-08 18:57:15,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210457906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:57:15,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551942214] [2024-11-08 18:57:15,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:57:15,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:57:15,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:15,931 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:57:15,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-08 18:57:16,163 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-08 18:57:16,163 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:57:16,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 18:57:16,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:57:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:57:16,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:57:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:57:16,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551942214] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:57:16,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:57:16,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-08 18:57:16,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549267912] [2024-11-08 18:57:16,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:57:16,532 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 18:57:16,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:16,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 4 times [2024-11-08 18:57:16,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:16,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525130583] [2024-11-08 18:57:16,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:16,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:16,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:57:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:16,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:57:16,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:16,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 18:57:16,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-08 18:57:16,593 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:57:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:16,871 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2024-11-08 18:57:16,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2024-11-08 18:57:16,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:16,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 95 transitions. [2024-11-08 18:57:16,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2024-11-08 18:57:16,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-11-08 18:57:16,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 95 transitions. [2024-11-08 18:57:16,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 18:57:16,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 95 transitions. [2024-11-08 18:57:16,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 95 transitions. [2024-11-08 18:57:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 50. [2024-11-08 18:57:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:57:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2024-11-08 18:57:16,886 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2024-11-08 18:57:16,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 18:57:16,888 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2024-11-08 18:57:16,888 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-08 18:57:16,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions. [2024-11-08 18:57:16,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:16,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:57:16,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:57:16,890 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2024-11-08 18:57:16,890 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:57:16,892 INFO L745 eck$LassoCheckResult]: Stem: 628#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 629#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~post4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 623#L25-3 assume main_~i~0#1 < 1023; 624#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 625#L25-3 assume main_~i~0#1 < 1023; 626#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 630#L25-3 assume main_~i~0#1 < 1023; 670#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 669#L25-3 assume main_~i~0#1 < 1023; 668#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 667#L25-3 assume main_~i~0#1 < 1023; 666#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 665#L25-3 assume main_~i~0#1 < 1023; 664#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 663#L25-3 assume main_~i~0#1 < 1023; 662#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 661#L25-3 assume main_~i~0#1 < 1023; 660#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 659#L25-3 assume main_~i~0#1 < 1023; 658#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 657#L25-3 assume main_~i~0#1 < 1023; 656#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 655#L25-3 assume main_~i~0#1 < 1023; 654#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 653#L25-3 assume main_~i~0#1 < 1023; 652#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 651#L25-3 assume main_~i~0#1 < 1023; 650#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 649#L25-3 assume main_~i~0#1 < 1023; 648#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 647#L25-3 assume main_~i~0#1 < 1023; 646#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 645#L25-3 assume main_~i~0#1 < 1023; 644#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 643#L25-3 assume main_~i~0#1 < 1023; 642#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 641#L25-3 assume main_~i~0#1 < 1023; 640#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 639#L25-3 assume main_~i~0#1 < 1023; 638#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 637#L25-3 assume main_~i~0#1 < 1023; 636#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 635#L25-3 assume main_~i~0#1 < 1023; 634#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 633#L25-3 assume main_~i~0#1 < 1023; 632#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 631#L25-3 assume !(main_~i~0#1 < 1023); 627#L25-4 call write~int#1(0, main_~#A~0#1.base, 4092 + main_~#A~0#1.offset, 4);main_~i~0#1 := 0; 622#L30-3 [2024-11-08 18:57:16,892 INFO L747 eck$LassoCheckResult]: Loop: 622#L30-3 call main_#t~mem3#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4); 621#L30-1 assume !!(0 != main_#t~mem3#1);havoc main_#t~mem3#1;main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 622#L30-3 [2024-11-08 18:57:16,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:16,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1220247763, now seen corresponding path program 4 times [2024-11-08 18:57:16,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:16,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877393062] [2024-11-08 18:57:16,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:16,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:57:17,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:17,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877393062] [2024-11-08 18:57:17,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877393062] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:57:17,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759532877] [2024-11-08 18:57:17,762 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 18:57:17,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:57:17,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:17,767 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:57:17,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-08 18:57:17,904 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 18:57:17,904 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:57:17,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 18:57:17,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:57:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:57:18,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:57:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:57:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759532877] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:57:19,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:57:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-08 18:57:19,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220338047] [2024-11-08 18:57:19,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:57:19,044 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 18:57:19,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 5 times [2024-11-08 18:57:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:19,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142166615] [2024-11-08 18:57:19,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:19,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:57:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:19,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:57:19,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:19,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-08 18:57:19,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-08 18:57:19,088 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:57:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:19,599 INFO L93 Difference]: Finished difference Result 190 states and 191 transitions. [2024-11-08 18:57:19,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 191 transitions. [2024-11-08 18:57:19,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:19,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 190 states and 191 transitions. [2024-11-08 18:57:19,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2024-11-08 18:57:19,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2024-11-08 18:57:19,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 191 transitions. [2024-11-08 18:57:19,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 18:57:19,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 190 states and 191 transitions. [2024-11-08 18:57:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 191 transitions. [2024-11-08 18:57:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 98. [2024-11-08 18:57:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 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-08 18:57:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2024-11-08 18:57:19,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2024-11-08 18:57:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-08 18:57:19,611 INFO L425 stractBuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2024-11-08 18:57:19,611 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-08 18:57:19,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions. [2024-11-08 18:57:19,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:19,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:57:19,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:57:19,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2024-11-08 18:57:19,615 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:57:19,615 INFO L745 eck$LassoCheckResult]: Stem: 1202#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1203#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~post4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 1197#L25-3 assume main_~i~0#1 < 1023; 1198#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1199#L25-3 assume main_~i~0#1 < 1023; 1200#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1292#L25-3 assume main_~i~0#1 < 1023; 1291#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1290#L25-3 assume main_~i~0#1 < 1023; 1289#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1288#L25-3 assume main_~i~0#1 < 1023; 1287#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1286#L25-3 assume main_~i~0#1 < 1023; 1285#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1284#L25-3 assume main_~i~0#1 < 1023; 1283#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1282#L25-3 assume main_~i~0#1 < 1023; 1281#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1280#L25-3 assume main_~i~0#1 < 1023; 1279#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1278#L25-3 assume main_~i~0#1 < 1023; 1277#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1276#L25-3 assume main_~i~0#1 < 1023; 1275#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1274#L25-3 assume main_~i~0#1 < 1023; 1273#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1272#L25-3 assume main_~i~0#1 < 1023; 1271#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1270#L25-3 assume main_~i~0#1 < 1023; 1269#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1268#L25-3 assume main_~i~0#1 < 1023; 1267#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1266#L25-3 assume main_~i~0#1 < 1023; 1265#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1264#L25-3 assume main_~i~0#1 < 1023; 1263#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1262#L25-3 assume main_~i~0#1 < 1023; 1261#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1260#L25-3 assume main_~i~0#1 < 1023; 1259#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1258#L25-3 assume main_~i~0#1 < 1023; 1257#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1256#L25-3 assume main_~i~0#1 < 1023; 1255#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1254#L25-3 assume main_~i~0#1 < 1023; 1253#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1252#L25-3 assume main_~i~0#1 < 1023; 1251#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1250#L25-3 assume main_~i~0#1 < 1023; 1249#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1248#L25-3 assume main_~i~0#1 < 1023; 1247#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1246#L25-3 assume main_~i~0#1 < 1023; 1245#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1244#L25-3 assume main_~i~0#1 < 1023; 1243#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1242#L25-3 assume main_~i~0#1 < 1023; 1241#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1240#L25-3 assume main_~i~0#1 < 1023; 1239#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1238#L25-3 assume main_~i~0#1 < 1023; 1237#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1236#L25-3 assume main_~i~0#1 < 1023; 1235#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1234#L25-3 assume main_~i~0#1 < 1023; 1233#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1232#L25-3 assume main_~i~0#1 < 1023; 1231#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1230#L25-3 assume main_~i~0#1 < 1023; 1229#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1228#L25-3 assume main_~i~0#1 < 1023; 1227#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1226#L25-3 assume main_~i~0#1 < 1023; 1225#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1224#L25-3 assume main_~i~0#1 < 1023; 1223#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1222#L25-3 assume main_~i~0#1 < 1023; 1221#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1220#L25-3 assume main_~i~0#1 < 1023; 1219#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1218#L25-3 assume main_~i~0#1 < 1023; 1217#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1216#L25-3 assume main_~i~0#1 < 1023; 1215#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1214#L25-3 assume main_~i~0#1 < 1023; 1213#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1212#L25-3 assume main_~i~0#1 < 1023; 1211#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1210#L25-3 assume main_~i~0#1 < 1023; 1209#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1208#L25-3 assume main_~i~0#1 < 1023; 1207#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1206#L25-3 assume main_~i~0#1 < 1023; 1205#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1204#L25-3 assume !(main_~i~0#1 < 1023); 1201#L25-4 call write~int#1(0, main_~#A~0#1.base, 4092 + main_~#A~0#1.offset, 4);main_~i~0#1 := 0; 1196#L30-3 [2024-11-08 18:57:19,615 INFO L747 eck$LassoCheckResult]: Loop: 1196#L30-3 call main_#t~mem3#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4); 1195#L30-1 assume !!(0 != main_#t~mem3#1);havoc main_#t~mem3#1;main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1196#L30-3 [2024-11-08 18:57:19,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:19,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1570276939, now seen corresponding path program 5 times [2024-11-08 18:57:19,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:19,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381374805] [2024-11-08 18:57:19,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:19,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:57:22,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:22,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381374805] [2024-11-08 18:57:22,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381374805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:57:22,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427523755] [2024-11-08 18:57:22,320 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 18:57:22,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:57:22,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:22,323 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:57:22,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-08 18:57:44,873 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-08 18:57:44,873 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:57:44,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-08 18:57:44,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:57:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:57:45,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:57:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:57:48,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427523755] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:57:48,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:57:48,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-11-08 18:57:48,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112833390] [2024-11-08 18:57:48,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:57:48,935 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-08 18:57:48,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:48,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 6 times [2024-11-08 18:57:48,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:48,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545400639] [2024-11-08 18:57:48,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:48,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:48,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:57:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:57:48,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:57:48,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:57:48,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-08 18:57:48,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-11-08 18:57:48,993 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. cyclomatic complexity: 3 Second operand has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 97 states have internal predecessors, (193), 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-08 18:57:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:57:50,878 INFO L93 Difference]: Finished difference Result 382 states and 383 transitions. [2024-11-08 18:57:50,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 382 states and 383 transitions. [2024-11-08 18:57:50,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:50,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 382 states to 382 states and 383 transitions. [2024-11-08 18:57:50,885 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2024-11-08 18:57:50,885 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2024-11-08 18:57:50,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 382 states and 383 transitions. [2024-11-08 18:57:50,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-08 18:57:50,890 INFO L218 hiAutomatonCegarLoop]: Abstraction has 382 states and 383 transitions. [2024-11-08 18:57:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states and 383 transitions. [2024-11-08 18:57:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 194. [2024-11-08 18:57:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 193 states have internal predecessors, (195), 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-08 18:57:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2024-11-08 18:57:50,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 194 states and 195 transitions. [2024-11-08 18:57:50,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-08 18:57:50,906 INFO L425 stractBuchiCegarLoop]: Abstraction has 194 states and 195 transitions. [2024-11-08 18:57:50,906 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-08 18:57:50,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 195 transitions. [2024-11-08 18:57:50,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-11-08 18:57:50,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-08 18:57:50,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-08 18:57:50,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1] [2024-11-08 18:57:50,915 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-08 18:57:50,915 INFO L745 eck$LassoCheckResult]: Stem: 2352#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 2353#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~post4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~i~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(4096);havoc main_~i~0#1;main_~i~0#1 := 0; 2347#L25-3 assume main_~i~0#1 < 1023; 2348#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2349#L25-3 assume main_~i~0#1 < 1023; 2350#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2538#L25-3 assume main_~i~0#1 < 1023; 2537#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2536#L25-3 assume main_~i~0#1 < 1023; 2535#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2534#L25-3 assume main_~i~0#1 < 1023; 2533#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2532#L25-3 assume main_~i~0#1 < 1023; 2531#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2530#L25-3 assume main_~i~0#1 < 1023; 2529#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2528#L25-3 assume main_~i~0#1 < 1023; 2527#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2526#L25-3 assume main_~i~0#1 < 1023; 2525#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2524#L25-3 assume main_~i~0#1 < 1023; 2523#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2522#L25-3 assume main_~i~0#1 < 1023; 2521#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2520#L25-3 assume main_~i~0#1 < 1023; 2519#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2518#L25-3 assume main_~i~0#1 < 1023; 2517#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2516#L25-3 assume main_~i~0#1 < 1023; 2515#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2514#L25-3 assume main_~i~0#1 < 1023; 2513#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2512#L25-3 assume main_~i~0#1 < 1023; 2511#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2510#L25-3 assume main_~i~0#1 < 1023; 2509#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2508#L25-3 assume main_~i~0#1 < 1023; 2507#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2506#L25-3 assume main_~i~0#1 < 1023; 2505#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2504#L25-3 assume main_~i~0#1 < 1023; 2503#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2502#L25-3 assume main_~i~0#1 < 1023; 2501#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2500#L25-3 assume main_~i~0#1 < 1023; 2499#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2498#L25-3 assume main_~i~0#1 < 1023; 2497#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2496#L25-3 assume main_~i~0#1 < 1023; 2495#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2494#L25-3 assume main_~i~0#1 < 1023; 2493#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2492#L25-3 assume main_~i~0#1 < 1023; 2491#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2490#L25-3 assume main_~i~0#1 < 1023; 2489#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2488#L25-3 assume main_~i~0#1 < 1023; 2487#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2486#L25-3 assume main_~i~0#1 < 1023; 2485#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2484#L25-3 assume main_~i~0#1 < 1023; 2483#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2482#L25-3 assume main_~i~0#1 < 1023; 2481#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2480#L25-3 assume main_~i~0#1 < 1023; 2479#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2478#L25-3 assume main_~i~0#1 < 1023; 2477#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2476#L25-3 assume main_~i~0#1 < 1023; 2475#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2474#L25-3 assume main_~i~0#1 < 1023; 2473#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2472#L25-3 assume main_~i~0#1 < 1023; 2471#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2470#L25-3 assume main_~i~0#1 < 1023; 2469#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2468#L25-3 assume main_~i~0#1 < 1023; 2467#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2466#L25-3 assume main_~i~0#1 < 1023; 2465#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2464#L25-3 assume main_~i~0#1 < 1023; 2463#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2462#L25-3 assume main_~i~0#1 < 1023; 2461#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2460#L25-3 assume main_~i~0#1 < 1023; 2459#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2458#L25-3 assume main_~i~0#1 < 1023; 2457#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2456#L25-3 assume main_~i~0#1 < 1023; 2455#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2454#L25-3 assume main_~i~0#1 < 1023; 2453#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2452#L25-3 assume main_~i~0#1 < 1023; 2451#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2450#L25-3 assume main_~i~0#1 < 1023; 2449#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2448#L25-3 assume main_~i~0#1 < 1023; 2447#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2446#L25-3 assume main_~i~0#1 < 1023; 2445#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2444#L25-3 assume main_~i~0#1 < 1023; 2443#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2442#L25-3 assume main_~i~0#1 < 1023; 2441#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2440#L25-3 assume main_~i~0#1 < 1023; 2439#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2438#L25-3 assume main_~i~0#1 < 1023; 2437#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2436#L25-3 assume main_~i~0#1 < 1023; 2435#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2434#L25-3 assume main_~i~0#1 < 1023; 2433#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2432#L25-3 assume main_~i~0#1 < 1023; 2431#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2430#L25-3 assume main_~i~0#1 < 1023; 2429#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2428#L25-3 assume main_~i~0#1 < 1023; 2427#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2426#L25-3 assume main_~i~0#1 < 1023; 2425#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2424#L25-3 assume main_~i~0#1 < 1023; 2423#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2422#L25-3 assume main_~i~0#1 < 1023; 2421#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2420#L25-3 assume main_~i~0#1 < 1023; 2419#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2418#L25-3 assume main_~i~0#1 < 1023; 2417#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2416#L25-3 assume main_~i~0#1 < 1023; 2415#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2414#L25-3 assume main_~i~0#1 < 1023; 2413#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2412#L25-3 assume main_~i~0#1 < 1023; 2411#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2410#L25-3 assume main_~i~0#1 < 1023; 2409#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2408#L25-3 assume main_~i~0#1 < 1023; 2407#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2406#L25-3 assume main_~i~0#1 < 1023; 2405#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2404#L25-3 assume main_~i~0#1 < 1023; 2403#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2402#L25-3 assume main_~i~0#1 < 1023; 2401#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2400#L25-3 assume main_~i~0#1 < 1023; 2399#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2398#L25-3 assume main_~i~0#1 < 1023; 2397#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2396#L25-3 assume main_~i~0#1 < 1023; 2395#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2394#L25-3 assume main_~i~0#1 < 1023; 2393#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2392#L25-3 assume main_~i~0#1 < 1023; 2391#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2390#L25-3 assume main_~i~0#1 < 1023; 2389#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2388#L25-3 assume main_~i~0#1 < 1023; 2387#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2386#L25-3 assume main_~i~0#1 < 1023; 2385#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2384#L25-3 assume main_~i~0#1 < 1023; 2383#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2382#L25-3 assume main_~i~0#1 < 1023; 2381#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2380#L25-3 assume main_~i~0#1 < 1023; 2379#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2378#L25-3 assume main_~i~0#1 < 1023; 2377#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2376#L25-3 assume main_~i~0#1 < 1023; 2375#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2374#L25-3 assume main_~i~0#1 < 1023; 2373#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2372#L25-3 assume main_~i~0#1 < 1023; 2371#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2370#L25-3 assume main_~i~0#1 < 1023; 2369#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2368#L25-3 assume main_~i~0#1 < 1023; 2367#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2366#L25-3 assume main_~i~0#1 < 1023; 2365#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2364#L25-3 assume main_~i~0#1 < 1023; 2363#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2362#L25-3 assume main_~i~0#1 < 1023; 2361#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2360#L25-3 assume main_~i~0#1 < 1023; 2359#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2358#L25-3 assume main_~i~0#1 < 1023; 2357#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2356#L25-3 assume main_~i~0#1 < 1023; 2355#L25-1 assume !!(main_~i~0#1 < 1023);havoc main_#t~nondet1#1;call write~int#1(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;main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2354#L25-3 assume !(main_~i~0#1 < 1023); 2351#L25-4 call write~int#1(0, main_~#A~0#1.base, 4092 + main_~#A~0#1.offset, 4);main_~i~0#1 := 0; 2346#L30-3 [2024-11-08 18:57:50,916 INFO L747 eck$LassoCheckResult]: Loop: 2346#L30-3 call main_#t~mem3#1 := read~int#1(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4); 2345#L30-1 assume !!(0 != main_#t~mem3#1);havoc main_#t~mem3#1;main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2346#L30-3 [2024-11-08 18:57:50,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:57:50,916 INFO L85 PathProgramCache]: Analyzing trace with hash -944168645, now seen corresponding path program 6 times [2024-11-08 18:57:50,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:57:50,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012561626] [2024-11-08 18:57:50,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:57:50,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:57:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:57:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:57:58,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:57:58,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012561626] [2024-11-08 18:57:58,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012561626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:57:58,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441576701] [2024-11-08 18:57:58,828 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 18:57:58,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:57:58,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:57:58,834 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:57:58,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae4a51af-a433-4e4f-bb4f-2d83d3768f79/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process