./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 527bcce2 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_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx --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 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 21:01:36,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:01:36,997 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-21 21:01:37,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:01:37,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:01:37,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:01:37,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:01:37,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:01:37,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 21:01:37,050 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 21:01:37,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:01:37,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:01:37,053 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:01:37,055 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 21:01:37,055 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 21:01:37,056 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 21:01:37,056 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 21:01:37,056 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 21:01:37,057 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 21:01:37,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:01:37,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 21:01:37,058 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:01:37,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:01:37,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:01:37,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:01:37,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 21:01:37,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 21:01:37,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 21:01:37,061 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 21:01:37,061 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:01:37,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 21:01:37,063 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 21:01:37,063 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:01:37,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:01:37,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:01:37,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:01:37,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:01:37,065 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 21:01:37,065 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_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/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_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx 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 -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2023-11-21 21:01:37,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:01:37,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:01:37,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:01:37,375 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:01:37,375 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:01:37,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2023-11-21 21:01:40,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:01:40,850 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:01:40,851 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2023-11-21 21:01:40,863 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/data/c058eb2b8/ef7497c732264c05925d49758dfa9d67/FLAG1fbb7a7f1 [2023-11-21 21:01:40,880 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/data/c058eb2b8/ef7497c732264c05925d49758dfa9d67 [2023-11-21 21:01:40,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:01:40,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:01:40,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:01:40,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:01:40,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:01:40,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:01:40" (1/1) ... [2023-11-21 21:01:40,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1ae55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:40, skipping insertion in model container [2023-11-21 21:01:40,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:01:40" (1/1) ... [2023-11-21 21:01:40,930 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:01:41,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:01:41,186 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:01:41,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:01:41,231 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:01:41,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41 WrapperNode [2023-11-21 21:01:41,232 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:01:41,233 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:01:41,233 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:01:41,233 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:01:41,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41" (1/1) ... [2023-11-21 21:01:41,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41" (1/1) ... [2023-11-21 21:01:41,282 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 179 [2023-11-21 21:01:41,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:01:41,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:01:41,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:01:41,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:01:41,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41" (1/1) ... [2023-11-21 21:01:41,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41" (1/1) ... [2023-11-21 21:01:41,302 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41" (1/1) ... [2023-11-21 21:01:41,315 INFO L187 HeapSplitter]: Split 14 memory accesses to 3 slices as follows [2, 3, 9] [2023-11-21 21:01:41,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41" (1/1) ... [2023-11-21 21:01:41,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41" (1/1) ... [2023-11-21 21:01:41,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41" (1/1) ... [2023-11-21 21:01:41,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41" (1/1) ... [2023-11-21 21:01:41,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41" (1/1) ... [2023-11-21 21:01:41,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41" (1/1) ... [2023-11-21 21:01:41,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:01:41,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:01:41,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:01:41,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:01:41,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41" (1/1) ... [2023-11-21 21:01:41,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:41,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:41,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:41,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 21:01:41,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:01:41,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 21:01:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 21:01:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 21:01:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 21:01:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 21:01:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 21:01:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 21:01:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:01:41,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:01:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 21:01:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 21:01:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 21:01:41,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 21:01:41,596 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:01:41,600 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:01:41,952 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:01:41,962 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:01:41,962 INFO L308 CfgBuilder]: Removed 10 assume(true) statements. [2023-11-21 21:01:41,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:01:41 BoogieIcfgContainer [2023-11-21 21:01:41,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:01:41,965 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 21:01:41,966 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 21:01:41,970 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 21:01:41,971 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 21:01:41,972 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 09:01:40" (1/3) ... [2023-11-21 21:01:41,973 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29f83d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 09:01:41, skipping insertion in model container [2023-11-21 21:01:41,973 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 21:01:41,973 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:41" (2/3) ... [2023-11-21 21:01:41,974 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@29f83d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 09:01:41, skipping insertion in model container [2023-11-21 21:01:41,974 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 21:01:41,974 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:01:41" (3/3) ... [2023-11-21 21:01:41,975 INFO L332 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2023-11-21 21:01:42,038 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 21:01:42,039 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 21:01:42,039 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 21:01:42,039 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 21:01:42,039 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 21:01:42,040 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 21:01:42,040 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 21:01:42,040 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 21:01:42,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:42,090 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2023-11-21 21:01:42,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:01:42,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:01:42,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 21:01:42,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 21:01:42,098 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 21:01:42,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:42,108 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2023-11-21 21:01:42,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:01:42,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:01:42,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 21:01:42,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 21:01:42,119 INFO L748 eck$LassoCheckResult]: Stem: 23#$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(48, 2); 26#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 50#L33-3true [2023-11-21 21:01:42,119 INFO L750 eck$LassoCheckResult]: Loop: 50#L33-3true assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 15#L33-2true main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 50#L33-3true [2023-11-21 21:01:42,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:42,146 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-21 21:01:42,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:42,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700155251] [2023-11-21 21:01:42,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:42,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:42,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:01:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:42,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:01:42,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-21 21:01:42,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:42,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106085068] [2023-11-21 21:01:42,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:42,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:42,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:01:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:42,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:01:42,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:42,379 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-21 21:01:42,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:42,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989869977] [2023-11-21 21:01:42,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:42,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:42,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:01:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:42,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:01:42,759 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 21:01:42,760 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 21:01:42,760 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 21:01:42,760 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 21:01:42,760 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 21:01:42,760 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:42,761 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 21:01:42,761 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 21:01:42,761 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration1_Lasso [2023-11-21 21:01:42,761 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 21:01:42,761 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 21:01:42,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:42,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:42,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:42,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:42,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:42,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:42,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,032 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:43,352 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 21:01:43,357 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 21:01:43,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:43,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:43,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:43,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:43,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:43,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:01:43,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:43,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:43,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:43,389 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:01:43,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:01:43,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-21 21:01:43,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:01:43,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:43,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:43,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:43,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:43,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-21 21:01:43,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:43,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:43,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:01:43,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:43,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:43,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:43,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:01:43,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:01:43,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:01:43,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:43,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:43,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:43,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:43,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:43,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-21 21:01:43,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:43,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:01:43,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:43,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:43,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:43,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:01:43,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:01:43,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:01:43,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:43,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:43,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:43,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:43,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-21 21:01:43,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:43,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:43,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:01:43,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:43,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:43,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:43,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:01:43,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:01:43,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:01:43,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:43,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:43,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:43,618 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:43,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:43,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:43,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:43,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:43,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:43,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-21 21:01:43,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 21:01:43,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 21:01:43,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:01:43,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:43,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:43,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:43,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:43,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-21 21:01:43,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:43,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:43,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:43,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:43,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:43,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 21:01:43,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 21:01:43,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:01:43,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-11-21 21:01:43,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:43,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:43,767 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:43,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:43,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-21 21:01:43,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:43,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:43,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:43,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:43,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 21:01:43,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 21:01:43,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:01:43,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:43,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:43,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:43,828 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:43,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:43,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:43,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:43,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:43,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:43,852 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 21:01:43,852 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 21:01:43,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-21 21:01:43,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:01:43,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:43,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:43,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:43,888 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:43,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:43,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-21 21:01:43,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:43,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:01:43,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:43,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:43,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:43,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:01:43,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:01:43,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:01:43,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:43,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:43,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:43,954 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:43,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:43,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:43,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:43,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:43,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:43,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 21:01:43,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 21:01:43,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-21 21:01:44,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:01:44,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:44,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:44,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:44,023 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:44,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-21 21:01:44,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:44,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:44,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:44,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:44,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:44,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 21:01:44,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 21:01:44,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:01:44,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:44,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:44,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:44,091 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:44,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-21 21:01:44,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:44,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:44,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:44,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:44,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:44,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 21:01:44,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 21:01:44,133 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 21:01:44,167 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2023-11-21 21:01:44,167 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-11-21 21:01:44,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:44,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:44,211 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:44,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-21 21:01:44,218 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 21:01:44,240 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-21 21:01:44,240 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 21:01:44,240 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1) = -8*ULTIMATE.start_main_~x~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#set~0#1.base)_1 Supporting invariants [] [2023-11-21 21:01:44,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:44,281 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-11-21 21:01:44,291 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#set~0!base] could not be translated [2023-11-21 21:01:44,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 21:01:44,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 21:01:44,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:44,425 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-21 21:01:44,428 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 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) [2023-11-21 21:01:44,512 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 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 101 states and 157 transitions. Complement of second has 8 states. [2023-11-21 21:01:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-21 21:01:44,519 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) [2023-11-21 21:01:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2023-11-21 21:01:44,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 78 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-21 21:01:44,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:01:44,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 78 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-21 21:01:44,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:01:44,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 78 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-21 21:01:44,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:01:44,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 157 transitions. [2023-11-21 21:01:44,540 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2023-11-21 21:01:44,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 48 states and 74 transitions. [2023-11-21 21:01:44,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-11-21 21:01:44,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2023-11-21 21:01:44,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 74 transitions. [2023-11-21 21:01:44,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:44,548 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2023-11-21 21:01:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 74 transitions. [2023-11-21 21:01:44,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-21 21:01:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 47 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 74 transitions. [2023-11-21 21:01:44,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2023-11-21 21:01:44,584 INFO L428 stractBuchiCegarLoop]: Abstraction has 48 states and 74 transitions. [2023-11-21 21:01:44,584 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 21:01:44,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 74 transitions. [2023-11-21 21:01:44,588 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2023-11-21 21:01:44,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:01:44,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:01:44,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-21 21:01:44,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 21:01:44,589 INFO L748 eck$LassoCheckResult]: Stem: 254#$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(48, 2); 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 221#L33-3 assume !(main_~x~0#1 < 100000); 214#L33-4 main_~x~0#1 := 0; 215#L39-3 [2023-11-21 21:01:44,589 INFO L750 eck$LassoCheckResult]: Loop: 215#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 230#L40-3 assume !true; 232#L39-2 main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 215#L39-3 [2023-11-21 21:01:44,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:44,591 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2023-11-21 21:01:44,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:44,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564820265] [2023-11-21 21:01:44,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:44,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:44,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:44,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564820265] [2023-11-21 21:01:44,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564820265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:44,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:44,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:01:44,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60534282] [2023-11-21 21:01:44,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:44,698 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:01:44,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash 54521, now seen corresponding path program 1 times [2023-11-21 21:01:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:44,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461780822] [2023-11-21 21:01:44,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:44,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:44,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461780822] [2023-11-21 21:01:44,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461780822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:44,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:44,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:01:44,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553115774] [2023-11-21 21:01:44,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:44,712 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 21:01:44,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:44,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 21:01:44,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 21:01:44,716 INFO L87 Difference]: Start difference. First operand 48 states and 74 transitions. cyclomatic complexity: 31 Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:44,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:44,727 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2023-11-21 21:01:44,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 57 transitions. [2023-11-21 21:01:44,731 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2023-11-21 21:01:44,732 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 39 states and 51 transitions. [2023-11-21 21:01:44,732 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-21 21:01:44,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-21 21:01:44,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 51 transitions. [2023-11-21 21:01:44,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:44,734 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-21 21:01:44,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 51 transitions. [2023-11-21 21:01:44,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-21 21:01:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2023-11-21 21:01:44,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-21 21:01:44,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 21:01:44,741 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2023-11-21 21:01:44,741 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 21:01:44,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2023-11-21 21:01:44,743 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2023-11-21 21:01:44,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:01:44,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:01:44,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-21 21:01:44,744 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 21:01:44,744 INFO L748 eck$LassoCheckResult]: Stem: 344#$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(48, 2); 314#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 315#L33-3 assume !(main_~x~0#1 < 100000); 310#L33-4 main_~x~0#1 := 0; 311#L39-3 [2023-11-21 21:01:44,744 INFO L750 eck$LassoCheckResult]: Loop: 311#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 322#L40-3 assume !(main_~y~0#1 < main_~n~0#1); 324#L39-2 main_#t~post5#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 311#L39-3 [2023-11-21 21:01:44,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:44,745 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 2 times [2023-11-21 21:01:44,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:44,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647283064] [2023-11-21 21:01:44,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:44,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:44,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647283064] [2023-11-21 21:01:44,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647283064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:01:44,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317953394] [2023-11-21 21:01:44,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:44,809 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:01:44,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:44,810 INFO L85 PathProgramCache]: Analyzing trace with hash 53839, now seen corresponding path program 1 times [2023-11-21 21:01:44,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:44,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034056491] [2023-11-21 21:01:44,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:44,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:44,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:01:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:44,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:01:44,860 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 21:01:44,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 21:01:44,861 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 21:01:44,861 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 21:01:44,861 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-21 21:01:44,861 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:44,861 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 21:01:44,861 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 21:01:44,861 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2023-11-21 21:01:44,861 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 21:01:44,862 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 21:01:44,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:44,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:44,905 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 21:01:44,906 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-21 21:01:44,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:44,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:44,910 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:44,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:01:44,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:01:44,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-21 21:01:44,943 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 21:01:44,943 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5#1=0} Honda state: {ULTIMATE.start_main_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-21 21:01:44,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:44,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:44,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:44,967 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:44,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-21 21:01:44,979 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 21:01:44,979 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:01:45,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:45,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:45,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:45,011 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:45,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-21 21:01:45,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-21 21:01:45,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 21:01:45,283 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-21 21:01:45,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-11-21 21:01:45,289 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 21:01:45,289 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 21:01:45,289 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 21:01:45,290 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 21:01:45,290 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 21:01:45,290 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:45,290 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 21:01:45,290 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 21:01:45,290 INFO L133 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2023-11-21 21:01:45,290 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 21:01:45,290 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 21:01:45,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:45,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 21:01:45,362 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 21:01:45,362 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 21:01:45,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:45,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:45,364 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:45,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-21 21:01:45,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:45,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:45,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:01:45,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:45,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:45,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:45,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:01:45,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:01:45,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 21:01:45,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:45,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:45,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:45,412 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:45,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-21 21:01:45,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 21:01:45,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 21:01:45,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 21:01:45,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 21:01:45,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 21:01:45,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 21:01:45,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 21:01:45,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 21:01:45,445 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 21:01:45,450 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-21 21:01:45,450 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-11-21 21:01:45,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 21:01:45,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:45,457 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:45,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-21 21:01:45,463 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 21:01:45,464 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-21 21:01:45,464 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 21:01:45,464 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~x~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2023-11-21 21:01:45,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:45,476 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-21 21:01:45,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 21:01:45,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,518 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 21:01:45,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:45,546 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-21 21:01:45,547 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:45,603 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 51 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 94 transitions. Complement of second has 7 states. [2023-11-21 21:01:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-21 21:01:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2023-11-21 21:01:45,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 3 letters. [2023-11-21 21:01:45,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:01:45,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 3 letters. [2023-11-21 21:01:45,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:01:45,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 6 letters. [2023-11-21 21:01:45,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 21:01:45,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 94 transitions. [2023-11-21 21:01:45,611 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 31 [2023-11-21 21:01:45,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 55 states and 74 transitions. [2023-11-21 21:01:45,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-11-21 21:01:45,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2023-11-21 21:01:45,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 74 transitions. [2023-11-21 21:01:45,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:01:45,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 74 transitions. [2023-11-21 21:01:45,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 74 transitions. [2023-11-21 21:01:45,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2023-11-21 21:01:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 43 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:45,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2023-11-21 21:01:45,623 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 59 transitions. [2023-11-21 21:01:45,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:45,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:45,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:01:45,624 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. 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) [2023-11-21 21:01:45,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:45,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-21 21:01:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:45,723 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2023-11-21 21:01:45,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 104 transitions. [2023-11-21 21:01:45,724 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 54 [2023-11-21 21:01:45,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 104 transitions. [2023-11-21 21:01:45,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2023-11-21 21:01:45,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2023-11-21 21:01:45,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 104 transitions. [2023-11-21 21:01:45,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:01:45,726 INFO L218 hiAutomatonCegarLoop]: Abstraction has 81 states and 104 transitions. [2023-11-21 21:01:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 104 transitions. [2023-11-21 21:01:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 44. [2023-11-21 21:01:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2023-11-21 21:01:45,730 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 58 transitions. [2023-11-21 21:01:45,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:45,731 INFO L428 stractBuchiCegarLoop]: Abstraction has 44 states and 58 transitions. [2023-11-21 21:01:45,731 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 21:01:45,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 58 transitions. [2023-11-21 21:01:45,732 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2023-11-21 21:01:45,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:01:45,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:01:45,733 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:45,733 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-21 21:01:45,733 INFO L748 eck$LassoCheckResult]: Stem: 626#$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(48, 2); 595#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 596#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 624#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 625#L33-3 assume !(main_~x~0#1 < 100000); 591#L33-4 main_~x~0#1 := 0; 592#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 601#L40-3 [2023-11-21 21:01:45,734 INFO L750 eck$LassoCheckResult]: Loop: 601#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 602#L13 assume !(0 == __VERIFIER_assert_~cond#1); 587#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;havoc main_#t~mem8#1; 588#L40-2 main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 601#L40-3 [2023-11-21 21:01:45,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:45,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669547, now seen corresponding path program 1 times [2023-11-21 21:01:45,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:45,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158622651] [2023-11-21 21:01:45,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:45,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:45,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:45,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158622651] [2023-11-21 21:01:45,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158622651] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:45,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512360049] [2023-11-21 21:01:45,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:45,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:45,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:45,786 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:45,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-21 21:01:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:45,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 21:01:45,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:45,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:01:45,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:45,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512360049] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:01:45,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:01:45,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-21 21:01:45,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426311335] [2023-11-21 21:01:45,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:01:45,908 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:01:45,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1922577, now seen corresponding path program 1 times [2023-11-21 21:01:45,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:45,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293733896] [2023-11-21 21:01:45,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:45,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:45,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:01:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:45,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:01:46,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:46,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:01:46,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-21 21:01:46,044 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. cyclomatic complexity: 20 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:46,186 INFO L93 Difference]: Finished difference Result 197 states and 253 transitions. [2023-11-21 21:01:46,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 253 transitions. [2023-11-21 21:01:46,188 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 132 [2023-11-21 21:01:46,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 197 states and 253 transitions. [2023-11-21 21:01:46,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2023-11-21 21:01:46,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2023-11-21 21:01:46,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 253 transitions. [2023-11-21 21:01:46,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 21:01:46,193 INFO L218 hiAutomatonCegarLoop]: Abstraction has 197 states and 253 transitions. [2023-11-21 21:01:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 253 transitions. [2023-11-21 21:01:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 50. [2023-11-21 21:01:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.28) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2023-11-21 21:01:46,208 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-11-21 21:01:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:01:46,209 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-11-21 21:01:46,209 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-21 21:01:46,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 64 transitions. [2023-11-21 21:01:46,210 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2023-11-21 21:01:46,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:01:46,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:01:46,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2023-11-21 21:01:46,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-21 21:01:46,211 INFO L748 eck$LassoCheckResult]: Stem: 913#$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(48, 2); 880#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 881#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 914#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 915#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 911#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 912#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 919#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 918#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 917#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 916#L33-3 assume !(main_~x~0#1 < 100000); 874#L33-4 main_~x~0#1 := 0; 875#L39-3 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 888#L40-3 [2023-11-21 21:01:46,211 INFO L750 eck$LassoCheckResult]: Loop: 888#L40-3 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem7#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem8#1 := read~int#2(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~y~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem7#1 != main_#t~mem8#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 889#L13 assume !(0 == __VERIFIER_assert_~cond#1); 876#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem7#1;havoc main_#t~mem8#1; 877#L40-2 main_#t~post6#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 888#L40-3 [2023-11-21 21:01:46,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash 82232677, now seen corresponding path program 2 times [2023-11-21 21:01:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:46,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161169172] [2023-11-21 21:01:46,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-21 21:01:46,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:46,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161169172] [2023-11-21 21:01:46,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161169172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:46,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:46,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:01:46,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658389989] [2023-11-21 21:01:46,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:46,305 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:01:46,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1922577, now seen corresponding path program 2 times [2023-11-21 21:01:46,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:46,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9191252] [2023-11-21 21:01:46,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:46,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:46,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:01:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:46,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:01:46,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:46,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:01:46,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:01:46,425 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:46,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:46,466 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2023-11-21 21:01:46,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 65 transitions. [2023-11-21 21:01:46,467 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-11-21 21:01:46,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 63 transitions. [2023-11-21 21:01:46,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2023-11-21 21:01:46,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2023-11-21 21:01:46,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2023-11-21 21:01:46,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:46,470 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2023-11-21 21:01:46,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2023-11-21 21:01:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2023-11-21 21:01:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.24) internal successors, (62), 49 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2023-11-21 21:01:46,482 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 62 transitions. [2023-11-21 21:01:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 21:01:46,484 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 62 transitions. [2023-11-21 21:01:46,485 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-21 21:01:46,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 62 transitions. [2023-11-21 21:01:46,485 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-11-21 21:01:46,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:01:46,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:01:46,486 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:46,486 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 21:01:46,488 INFO L748 eck$LassoCheckResult]: Stem: 1015#$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(48, 2); 985#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 986#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1012#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1013#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1016#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1022#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1021#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1020#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1018#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1017#L33-3 assume !(main_~x~0#1 < 100000); 983#L33-4 main_~x~0#1 := 0; 984#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 1001#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1002#L47-3 [2023-11-21 21:01:46,488 INFO L750 eck$LassoCheckResult]: Loop: 1002#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 1003#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1002#L47-3 [2023-11-21 21:01:46,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:46,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754313, now seen corresponding path program 1 times [2023-11-21 21:01:46,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:46,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884029908] [2023-11-21 21:01:46,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:46,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:46,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884029908] [2023-11-21 21:01:46,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884029908] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:46,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208754876] [2023-11-21 21:01:46,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:46,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:46,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:46,644 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:46,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-21 21:01:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:46,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 21:01:46,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:46,748 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:01:46,833 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:46,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208754876] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:01:46,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:01:46,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-21 21:01:46,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208543817] [2023-11-21 21:01:46,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:01:46,834 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:01:46,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 1 times [2023-11-21 21:01:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:46,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872884174] [2023-11-21 21:01:46,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:46,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:01:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:46,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:01:46,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:46,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-21 21:01:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-21 21:01:46,891 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. cyclomatic complexity: 17 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:47,135 INFO L93 Difference]: Finished difference Result 292 states and 374 transitions. [2023-11-21 21:01:47,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 374 transitions. [2023-11-21 21:01:47,139 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 234 [2023-11-21 21:01:47,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 292 states and 374 transitions. [2023-11-21 21:01:47,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 272 [2023-11-21 21:01:47,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 272 [2023-11-21 21:01:47,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 292 states and 374 transitions. [2023-11-21 21:01:47,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:47,144 INFO L218 hiAutomatonCegarLoop]: Abstraction has 292 states and 374 transitions. [2023-11-21 21:01:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states and 374 transitions. [2023-11-21 21:01:47,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 62. [2023-11-21 21:01:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 61 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2023-11-21 21:01:47,148 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 74 transitions. [2023-11-21 21:01:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 21:01:47,149 INFO L428 stractBuchiCegarLoop]: Abstraction has 62 states and 74 transitions. [2023-11-21 21:01:47,149 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-21 21:01:47,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 74 transitions. [2023-11-21 21:01:47,150 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-11-21 21:01:47,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:01:47,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:01:47,151 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:47,151 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 21:01:47,151 INFO L748 eck$LassoCheckResult]: Stem: 1453#$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(48, 2); 1421#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 1422#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1455#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1456#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1450#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1451#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1472#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1471#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1470#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1469#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1468#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1467#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1466#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1465#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1464#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1463#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1462#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1461#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1460#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1459#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 1458#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1457#L33-3 assume !(main_~x~0#1 < 100000); 1419#L33-4 main_~x~0#1 := 0; 1420#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 1437#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1438#L47-3 [2023-11-21 21:01:47,152 INFO L750 eck$LassoCheckResult]: Loop: 1438#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 1439#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 1438#L47-3 [2023-11-21 21:01:47,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash -95702845, now seen corresponding path program 2 times [2023-11-21 21:01:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:47,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128719896] [2023-11-21 21:01:47,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:47,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:47,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:47,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128719896] [2023-11-21 21:01:47,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128719896] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:47,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736887514] [2023-11-21 21:01:47,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 21:01:47,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:47,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:47,366 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:47,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-21 21:01:47,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 21:01:47,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:01:47,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 21:01:47,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:47,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:01:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:47,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736887514] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:01:47,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:01:47,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-21 21:01:47,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870118984] [2023-11-21 21:01:47,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:01:47,828 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:01:47,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 2 times [2023-11-21 21:01:47,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:47,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595703256] [2023-11-21 21:01:47,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:47,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:47,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:47,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:01:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:47,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:01:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:47,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-21 21:01:47,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-21 21:01:47,888 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. cyclomatic complexity: 17 Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:48,533 INFO L93 Difference]: Finished difference Result 592 states and 758 transitions. [2023-11-21 21:01:48,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 592 states and 758 transitions. [2023-11-21 21:01:48,539 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 474 [2023-11-21 21:01:48,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 592 states to 592 states and 758 transitions. [2023-11-21 21:01:48,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 548 [2023-11-21 21:01:48,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 548 [2023-11-21 21:01:48,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 592 states and 758 transitions. [2023-11-21 21:01:48,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:48,548 INFO L218 hiAutomatonCegarLoop]: Abstraction has 592 states and 758 transitions. [2023-11-21 21:01:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states and 758 transitions. [2023-11-21 21:01:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 86. [2023-11-21 21:01:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2023-11-21 21:01:48,560 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 98 transitions. [2023-11-21 21:01:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 21:01:48,564 INFO L428 stractBuchiCegarLoop]: Abstraction has 86 states and 98 transitions. [2023-11-21 21:01:48,564 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-21 21:01:48,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 98 transitions. [2023-11-21 21:01:48,565 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-11-21 21:01:48,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:01:48,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:01:48,567 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:48,568 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 21:01:48,569 INFO L748 eck$LassoCheckResult]: Stem: 2283#$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(48, 2); 2255#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 2256#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2284#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2285#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2280#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2281#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2325#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2324#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2323#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2322#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2321#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2320#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2319#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2318#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2317#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2316#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2315#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2314#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2313#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2312#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2311#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2310#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2309#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2308#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2307#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2306#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2305#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2304#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2303#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2302#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2301#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2300#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2299#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2298#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2297#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2296#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2295#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2294#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2293#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2292#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2291#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2290#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2289#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2288#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 2287#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2286#L33-3 assume !(main_~x~0#1 < 100000); 2251#L33-4 main_~x~0#1 := 0; 2252#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 2270#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 2271#L47-3 [2023-11-21 21:01:48,569 INFO L750 eck$LassoCheckResult]: Loop: 2271#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 2272#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 2271#L47-3 [2023-11-21 21:01:48,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:48,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1293970907, now seen corresponding path program 3 times [2023-11-21 21:01:48,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:48,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182675246] [2023-11-21 21:01:48,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:48,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:49,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:49,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182675246] [2023-11-21 21:01:49,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182675246] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:49,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931363319] [2023-11-21 21:01:49,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 21:01:49,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:49,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:49,302 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:49,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-21 21:01:50,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2023-11-21 21:01:50,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:01:50,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-21 21:01:50,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:50,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:01:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:51,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931363319] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:01:51,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:01:51,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-11-21 21:01:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243515857] [2023-11-21 21:01:51,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:01:51,332 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:01:51,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 3 times [2023-11-21 21:01:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:51,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891743012] [2023-11-21 21:01:51,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:51,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:51,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:01:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:51,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:01:51,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:51,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-21 21:01:51,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-21 21:01:51,393 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. cyclomatic complexity: 17 Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 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) [2023-11-21 21:01:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:01:53,937 INFO L93 Difference]: Finished difference Result 1192 states and 1526 transitions. [2023-11-21 21:01:53,937 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1192 states and 1526 transitions. [2023-11-21 21:01:53,954 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 954 [2023-11-21 21:01:53,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1192 states to 1192 states and 1526 transitions. [2023-11-21 21:01:53,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1100 [2023-11-21 21:01:53,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1100 [2023-11-21 21:01:53,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1192 states and 1526 transitions. [2023-11-21 21:01:53,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:53,967 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1192 states and 1526 transitions. [2023-11-21 21:01:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states and 1526 transitions. [2023-11-21 21:01:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 134. [2023-11-21 21:01:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 1.0895522388059702) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2023-11-21 21:01:53,982 INFO L240 hiAutomatonCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-11-21 21:01:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 21:01:53,983 INFO L428 stractBuchiCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-11-21 21:01:53,984 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-21 21:01:53,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 146 transitions. [2023-11-21 21:01:53,985 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-11-21 21:01:53,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:01:53,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:01:53,990 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:53,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 21:01:53,992 INFO L748 eck$LassoCheckResult]: Stem: 3909#$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(48, 2); 3877#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 3878#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3911#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3912#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3906#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3907#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 4000#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3999#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3998#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3997#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3996#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3995#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3994#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3993#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3992#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3991#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3990#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3989#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3988#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3987#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3986#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3985#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3984#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3983#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3982#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3981#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3980#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3979#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3978#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3977#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3976#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3975#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3974#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3973#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3972#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3971#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3970#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3969#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3968#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3967#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3966#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3965#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3964#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3963#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3962#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3961#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3960#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3959#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3958#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3957#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3956#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3955#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3954#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3953#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3952#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3951#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3950#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3949#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3948#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3947#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3946#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3945#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3944#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3943#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3942#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3941#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3940#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3939#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3938#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3937#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3936#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3935#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3934#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3933#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3932#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3931#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3930#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3929#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3928#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3927#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3926#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3925#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3924#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3923#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3922#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3921#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3920#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3919#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3918#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3917#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3916#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3915#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 3914#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 3913#L33-3 assume !(main_~x~0#1 < 100000); 3875#L33-4 main_~x~0#1 := 0; 3876#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 3893#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 3894#L47-3 [2023-11-21 21:01:53,996 INFO L750 eck$LassoCheckResult]: Loop: 3894#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 3895#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 3894#L47-3 [2023-11-21 21:01:53,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:53,997 INFO L85 PathProgramCache]: Analyzing trace with hash -675114997, now seen corresponding path program 4 times [2023-11-21 21:01:53,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:53,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219817005] [2023-11-21 21:01:53,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:53,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:56,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:56,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219817005] [2023-11-21 21:01:56,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219817005] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:01:56,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726834873] [2023-11-21 21:01:56,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 21:01:56,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:01:56,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:56,563 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:01:56,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-21 21:01:56,754 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 21:01:56,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 21:01:56,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-21 21:01:56,763 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 21:01:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:56,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 21:02:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:02:00,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726834873] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 21:02:00,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 21:02:00,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2023-11-21 21:02:00,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976444658] [2023-11-21 21:02:00,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 21:02:00,331 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 21:02:00,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:00,331 INFO L85 PathProgramCache]: Analyzing trace with hash 3075, now seen corresponding path program 4 times [2023-11-21 21:02:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:00,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648855472] [2023-11-21 21:02:00,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:02:00,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:02:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:02:00,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:02:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:02:00,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-11-21 21:02:00,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2023-11-21 21:02:00,405 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. cyclomatic complexity: 17 Second operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 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) [2023-11-21 21:02:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 21:02:16,579 INFO L93 Difference]: Finished difference Result 2392 states and 3062 transitions. [2023-11-21 21:02:16,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2392 states and 3062 transitions. [2023-11-21 21:02:16,598 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 1914 [2023-11-21 21:02:16,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2392 states to 2392 states and 3062 transitions. [2023-11-21 21:02:16,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2204 [2023-11-21 21:02:16,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2204 [2023-11-21 21:02:16,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2392 states and 3062 transitions. [2023-11-21 21:02:16,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:02:16,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2392 states and 3062 transitions. [2023-11-21 21:02:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states and 3062 transitions. [2023-11-21 21:02:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 230. [2023-11-21 21:02:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 230 states have (on average 1.0521739130434782) internal successors, (242), 229 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:02:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 242 transitions. [2023-11-21 21:02:16,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 230 states and 242 transitions. [2023-11-21 21:02:16,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-11-21 21:02:16,640 INFO L428 stractBuchiCegarLoop]: Abstraction has 230 states and 242 transitions. [2023-11-21 21:02:16,640 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-21 21:02:16,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 242 transitions. [2023-11-21 21:02:16,642 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2023-11-21 21:02:16,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 21:02:16,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 21:02:16,645 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1, 1, 1] [2023-11-21 21:02:16,646 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 21:02:16,646 INFO L748 eck$LassoCheckResult]: Stem: 7117#$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(48, 2); 7085#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~post6#1, main_#t~post5#1, main_#t~nondet10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~ret13#1, main_#t~mem14#1, main_#t~ret15#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post17#1, main_#t~post16#1, main_#t~post11#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post21#1, main_#t~post20#1, main_~n~0#1, main_~#set~0#1.base, main_~#set~0#1.offset, main_~x~0#1, main_~y~0#1, main_~#values~0#1.base, main_~#values~0#1.offset, main_~v~0#1;main_~n~0#1 := 0;call main_~#set~0#1.base, main_~#set~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := 0; 7086#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7119#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7120#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7114#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7115#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7304#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7303#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7302#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7301#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7300#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7299#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7298#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7297#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7296#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7295#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7294#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7293#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7292#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7291#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7290#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7289#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7288#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7287#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7286#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7285#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7284#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7283#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7282#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7281#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7280#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7279#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7278#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7277#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7276#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7275#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7274#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7273#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7272#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7271#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7270#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7269#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7268#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7267#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7266#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7265#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7264#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7263#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7262#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7261#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7260#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7259#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7258#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7257#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7256#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7255#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7254#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7253#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7252#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7251#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7250#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7249#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7248#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7247#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7246#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7245#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7244#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7243#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7242#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7241#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7240#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7239#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7238#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7237#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7236#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7235#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7234#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7233#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7232#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7231#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7230#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7229#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7228#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7227#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7226#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7225#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7224#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7223#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7222#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7221#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7220#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7219#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7218#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7217#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7216#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7215#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7214#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7213#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7212#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7211#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7210#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7209#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7208#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7207#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7206#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7205#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7204#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7203#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7202#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7201#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7200#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7199#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7198#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7197#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7196#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7195#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7194#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7193#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7192#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7191#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7190#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7189#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7188#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7187#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7186#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7185#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7184#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7183#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7182#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7181#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7180#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7179#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7178#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7177#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7176#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7175#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7174#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7173#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7172#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7171#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7170#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7169#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7168#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7167#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7166#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7165#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7164#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7163#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7162#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7161#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7160#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7159#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7158#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7157#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7156#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7155#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7154#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7153#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7152#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7151#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7150#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7149#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7148#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7147#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7146#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7145#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7144#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7143#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7142#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7141#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7140#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7139#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7138#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7137#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7136#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7135#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7134#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7133#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7132#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7131#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7130#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7129#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7128#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7127#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7126#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7125#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7124#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7123#L33-3 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet4#1;call write~int#2(main_#t~nondet4#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet4#1; 7122#L33-2 main_#t~post3#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 7121#L33-3 assume !(main_~x~0#1 < 100000); 7083#L33-4 main_~x~0#1 := 0; 7084#L39-3 assume !(main_~x~0#1 < main_~n~0#1); 7101#L39-4 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 7102#L47-3 [2023-11-21 21:02:16,647 INFO L750 eck$LassoCheckResult]: Loop: 7102#L47-3 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet10#1;call write~int#1(main_#t~nondet10#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet10#1; 7103#L47-2 main_#t~post9#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; 7102#L47-3 [2023-11-21 21:02:16,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:02:16,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1064733589, now seen corresponding path program 5 times [2023-11-21 21:02:16,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:02:16,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2192175] [2023-11-21 21:02:16,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:02:16,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:02:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:02:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:02:24,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:02:24,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2192175] [2023-11-21 21:02:24,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2192175] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 21:02:24,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187054263] [2023-11-21 21:02:24,361 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 21:02:24,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 21:02:24,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:02:24,362 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 21:02:24,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0ac0b03-4d2b-4488-b168-6bb86984448a/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process