./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/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_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:41:23,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:41:23,913 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-13 13:41:23,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:41:23,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:41:23,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:41:23,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:41:23,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:41:23,958 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:41:23,959 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:41:23,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:41:23,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:41:23,961 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:41:23,961 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-13 13:41:23,962 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-13 13:41:23,962 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-13 13:41:23,962 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-13 13:41:23,962 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-13 13:41:23,962 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-13 13:41:23,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:41:23,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-13 13:41:23,963 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:41:23,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:41:23,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:41:23,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:41:23,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-13 13:41:23,963 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-13 13:41:23,963 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-13 13:41:23,964 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:41:23,964 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:41:23,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:41:23,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:41:23,964 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-13 13:41:23,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:41:23,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:41:23,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:41:23,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:41:23,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:41:23,965 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-13 13:41:23,966 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0286582125bb2879636b8cf3b934bed172850a3a3b0d880c07306d10439134a7 [2024-11-13 13:41:24,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:41:24,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:41:24,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:41:24,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:41:24,326 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:41:24,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i Unable to find full path for "g++" [2024-11-13 13:41:26,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:41:26,667 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:41:26,668 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2024-11-13 13:41:26,687 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/data/789686a03/87f8ba27d372401896341e83a2f4f652/FLAG522d64bfe [2024-11-13 13:41:26,717 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/data/789686a03/87f8ba27d372401896341e83a2f4f652 [2024-11-13 13:41:26,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:41:26,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:41:26,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:41:26,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:41:26,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:41:26,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:41:26" (1/1) ... [2024-11-13 13:41:26,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d8a425f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:26, skipping insertion in model container [2024-11-13 13:41:26,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:41:26" (1/1) ... [2024-11-13 13:41:26,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:41:27,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:41:27,016 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:41:27,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:41:27,082 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:41:27,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27 WrapperNode [2024-11-13 13:41:27,084 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:41:27,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:41:27,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:41:27,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:41:27,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27" (1/1) ... [2024-11-13 13:41:27,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27" (1/1) ... [2024-11-13 13:41:27,146 INFO L138 Inliner]: procedures = 18, calls = 30, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 166 [2024-11-13 13:41:27,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:41:27,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:41:27,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:41:27,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:41:27,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27" (1/1) ... [2024-11-13 13:41:27,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27" (1/1) ... [2024-11-13 13:41:27,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27" (1/1) ... [2024-11-13 13:41:27,186 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 9, 3]. 64 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-11-13 13:41:27,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27" (1/1) ... [2024-11-13 13:41:27,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27" (1/1) ... [2024-11-13 13:41:27,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27" (1/1) ... [2024-11-13 13:41:27,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27" (1/1) ... [2024-11-13 13:41:27,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27" (1/1) ... [2024-11-13 13:41:27,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27" (1/1) ... [2024-11-13 13:41:27,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:41:27,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:41:27,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:41:27,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:41:27,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27" (1/1) ... [2024-11-13 13:41:27,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:27,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:27,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:27,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-13 13:41:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:41:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:41:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:41:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 13:41:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 13:41:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:41:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:41:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 13:41:27,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:41:27,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:41:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:41:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:41:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 13:41:27,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 13:41:27,420 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:41:27,423 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:41:27,857 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-13 13:41:27,861 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:41:27,879 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:41:27,880 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-13 13:41:27,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:41:27 BoogieIcfgContainer [2024-11-13 13:41:27,880 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:41:27,881 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-13 13:41:27,882 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-13 13:41:27,888 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-13 13:41:27,889 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 13:41:27,889 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.11 01:41:26" (1/3) ... [2024-11-13 13:41:27,891 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d5073f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 01:41:27, skipping insertion in model container [2024-11-13 13:41:27,891 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 13:41:27,891 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:41:27" (2/3) ... [2024-11-13 13:41:27,892 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d5073f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.11 01:41:27, skipping insertion in model container [2024-11-13 13:41:27,893 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-13 13:41:27,893 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:41:27" (3/3) ... [2024-11-13 13:41:27,894 INFO L333 chiAutomizerObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2024-11-13 13:41:27,964 INFO L299 stractBuchiCegarLoop]: Interprodecural is true [2024-11-13 13:41:27,965 INFO L300 stractBuchiCegarLoop]: Hoare is None [2024-11-13 13:41:27,965 INFO L301 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-13 13:41:27,965 INFO L302 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-13 13:41:27,965 INFO L303 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-13 13:41:27,965 INFO L304 stractBuchiCegarLoop]: Difference is false [2024-11-13 13:41:27,966 INFO L305 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-13 13:41:27,966 INFO L309 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-13 13:41:27,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:27,995 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2024-11-13 13:41:27,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:41:27,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:41:28,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:41:28,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 13:41:28,003 INFO L331 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-13 13:41:28,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:28,008 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2024-11-13 13:41:28,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:41:28,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:41:28,010 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-13 13:41:28,010 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 13:41:28,020 INFO L745 eck$LassoCheckResult]: Stem: 42#$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); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#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; 32#L33-2true [2024-11-13 13:41:28,020 INFO L747 eck$LassoCheckResult]: Loop: 32#L33-2true assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 32#L33-2true [2024-11-13 13:41:28,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:28,030 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-13 13:41:28,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:28,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579375582] [2024-11-13 13:41:28,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:28,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:28,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:41:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:28,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:41:28,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 1 times [2024-11-13 13:41:28,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:28,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021441943] [2024-11-13 13:41:28,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:28,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:28,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:41:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:28,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:41:28,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:28,242 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2024-11-13 13:41:28,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:28,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121874536] [2024-11-13 13:41:28,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:28,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:28,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:41:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:28,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:41:28,735 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 13:41:28,737 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 13:41:28,737 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 13:41:28,738 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 13:41:28,739 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-13 13:41:28,739 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:28,740 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 13:41:28,740 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 13:41:28,740 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration1_Lasso [2024-11-13 13:41:28,740 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 13:41:28,741 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 13:41:28,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:28,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:28,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:28,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:28,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:28,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:28,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:28,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:28,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:29,518 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 13:41:29,522 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-13 13:41:29,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:29,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:29,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:29,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-13 13:41:29,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 13:41:29,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:41:29,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 13:41:29,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:41:29,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:41:29,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:41:29,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 13:41:29,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 13:41:29,562 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:41:29,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-13 13:41:29,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:29,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:29,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:29,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-13 13:41:29,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 13:41:29,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:41:29,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 13:41:29,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:41:29,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:41:29,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:41:29,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 13:41:29,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 13:41:29,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:41:29,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-11-13 13:41:29,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:29,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:29,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:29,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-13 13:41:29,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 13:41:29,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:41:29,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 13:41:29,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:41:29,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:41:29,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:41:29,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 13:41:29,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 13:41:29,668 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:41:29,686 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-13 13:41:29,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:29,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:29,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:29,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 13:41:29,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-13 13:41:29,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:41:29,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 13:41:29,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:41:29,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:41:29,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:41:29,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 13:41:29,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 13:41:29,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:41:29,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-13 13:41:29,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:29,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:29,730 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:29,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-13 13:41:29,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 13:41:29,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:41:29,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 13:41:29,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:41:29,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:41:29,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:41:29,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 13:41:29,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 13:41:29,747 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:41:29,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-13 13:41:29,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:29,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:29,771 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:29,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-13 13:41:29,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 13:41:29,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:41:29,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 13:41:29,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:41:29,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:41:29,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:41:29,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 13:41:29,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 13:41:29,795 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:41:29,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-13 13:41:29,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:29,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:29,816 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:29,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-13 13:41:29,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 13:41:29,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:41:29,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 13:41:29,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:41:29,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:41:29,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:41:29,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 13:41:29,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 13:41:29,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:41:29,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-13 13:41:29,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:29,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:29,860 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:29,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-13 13:41:29,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 13:41:29,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:41:29,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 13:41:29,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:41:29,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:41:29,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:41:29,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 13:41:29,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 13:41:29,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:41:29,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-13 13:41:29,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:29,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:29,893 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:29,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-13 13:41:29,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 13:41:29,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:41:29,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:41:29,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:41:29,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:41:29,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 13:41:29,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 13:41:29,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:41:29,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-13 13:41:29,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:29,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:29,944 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:29,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-13 13:41:29,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 13:41:29,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:41:29,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:41:29,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:41:29,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:41:29,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 13:41:29,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 13:41:29,971 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:41:29,989 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-11-13 13:41:29,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:29,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:29,992 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:29,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-13 13:41:29,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 13:41:30,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:41:30,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:41:30,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:41:30,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:41:30,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 13:41:30,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 13:41:30,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-13 13:41:30,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-13 13:41:30,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:30,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:30,040 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:30,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-11-13 13:41:30,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 13:41:30,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:41:30,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:41:30,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:41:30,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:41:30,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-13 13:41:30,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-13 13:41:30,081 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-13 13:41:30,126 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-13 13:41:30,129 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-13 13:41:30,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:30,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:30,133 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:30,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-11-13 13:41:30,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-13 13:41:30,161 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-13 13:41:30,161 INFO L474 LassoAnalysis]: Proved termination. [2024-11-13 13:41:30,162 INFO L476 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 [] [2024-11-13 13:41:30,181 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-13 13:41:30,199 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2024-11-13 13:41:30,209 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-13 13:41:30,210 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-13 13:41:30,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:30,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:41:30,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:41:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:30,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:41:30,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:41:30,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:30,310 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-11-13 13:41:30,313 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 45 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:30,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-13 13:41:30,401 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 45 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 88 states and 142 transitions. Complement of second has 4 states. [2024-11-13 13:41:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2024-11-13 13:41:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:30,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-13 13:41:30,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 2 letters. Loop has 1 letters. [2024-11-13 13:41:30,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 13:41:30,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 3 letters. Loop has 1 letters. [2024-11-13 13:41:30,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 13:41:30,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-13 13:41:30,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 13:41:30,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 142 transitions. [2024-11-13 13:41:30,421 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-13 13:41:30,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 42 states and 68 transitions. [2024-11-13 13:41:30,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-13 13:41:30,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-13 13:41:30,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 68 transitions. [2024-11-13 13:41:30,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:41:30,428 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 68 transitions. [2024-11-13 13:41:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 68 transitions. [2024-11-13 13:41:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-13 13:41:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.619047619047619) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 68 transitions. [2024-11-13 13:41:30,467 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 68 transitions. [2024-11-13 13:41:30,467 INFO L424 stractBuchiCegarLoop]: Abstraction has 42 states and 68 transitions. [2024-11-13 13:41:30,467 INFO L331 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-13 13:41:30,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 68 transitions. [2024-11-13 13:41:30,468 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2024-11-13 13:41:30,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:41:30,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:41:30,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-13 13:41:30,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 13:41:30,469 INFO L745 eck$LassoCheckResult]: Stem: 219#$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); 187#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#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; 188#L33-2 assume !(main_~x~0#1 < 100000); 214#L33-3 main_~x~0#1 := 0; 197#L39-2 [2024-11-13 13:41:30,469 INFO L747 eck$LassoCheckResult]: Loop: 197#L39-2 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 184#L40-2 assume !true; 196#L40-3 main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 197#L39-2 [2024-11-13 13:41:30,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash 925705, now seen corresponding path program 1 times [2024-11-13 13:41:30,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:30,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841856297] [2024-11-13 13:41:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:30,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:30,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841856297] [2024-11-13 13:41:30,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841856297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:30,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:30,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:41:30,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024079179] [2024-11-13 13:41:30,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:30,581 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 13:41:30,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash 52471, now seen corresponding path program 1 times [2024-11-13 13:41:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:30,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462582386] [2024-11-13 13:41:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:30,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:30,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462582386] [2024-11-13 13:41:30,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462582386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:30,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:30,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:41:30,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964421171] [2024-11-13 13:41:30,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:30,594 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-13 13:41:30,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:30,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:41:30,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:41:30,601 INFO L87 Difference]: Start difference. First operand 42 states and 68 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) [2024-11-13 13:41:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:30,611 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2024-11-13 13:41:30,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. [2024-11-13 13:41:30,615 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2024-11-13 13:41:30,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 33 states and 45 transitions. [2024-11-13 13:41:30,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-13 13:41:30,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-13 13:41:30,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 45 transitions. [2024-11-13 13:41:30,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:41:30,616 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-11-13 13:41:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 45 transitions. [2024-11-13 13:41:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-13 13:41:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 32 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2024-11-13 13:41:30,623 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-11-13 13:41:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:41:30,624 INFO L424 stractBuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2024-11-13 13:41:30,624 INFO L331 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-13 13:41:30,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2024-11-13 13:41:30,625 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2024-11-13 13:41:30,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:41:30,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:41:30,627 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-11-13 13:41:30,628 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 13:41:30,628 INFO L745 eck$LassoCheckResult]: Stem: 297#$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); 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#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; 272#L33-2 assume !(main_~x~0#1 < 100000); 293#L33-3 main_~x~0#1 := 0; 279#L39-2 [2024-11-13 13:41:30,628 INFO L747 eck$LassoCheckResult]: Loop: 279#L39-2 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 270#L40-2 assume !(main_~y~0#1 < main_~n~0#1); 278#L40-3 main_#t~post8#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 279#L39-2 [2024-11-13 13:41:30,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:30,629 INFO L85 PathProgramCache]: Analyzing trace with hash 925705, now seen corresponding path program 2 times [2024-11-13 13:41:30,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:30,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567106394] [2024-11-13 13:41:30,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:30,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:30,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:30,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:30,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567106394] [2024-11-13 13:41:30,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567106394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:30,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:30,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:41:30,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118848694] [2024-11-13 13:41:30,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:30,695 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 13:41:30,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:30,695 INFO L85 PathProgramCache]: Analyzing trace with hash 51851, now seen corresponding path program 1 times [2024-11-13 13:41:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:30,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322430014] [2024-11-13 13:41:30,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:30,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:41:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:30,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:41:30,735 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 13:41:30,735 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 13:41:30,735 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 13:41:30,735 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 13:41:30,735 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-13 13:41:30,736 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:30,736 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 13:41:30,736 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 13:41:30,736 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2024-11-13 13:41:30,736 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 13:41:30,736 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 13:41:30,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:30,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:30,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:30,781 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 13:41:30,782 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-13 13:41:30,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:30,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:30,786 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:30,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-11-13 13:41:30,791 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-13 13:41:30,791 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-13 13:41:30,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-11-13 13:41:30,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:30,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:30,842 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:30,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-11-13 13:41:30,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-13 13:41:30,847 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-13 13:41:31,086 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-13 13:41:31,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-13 13:41:31,090 INFO L204 LassoAnalysis]: Preferences: [2024-11-13 13:41:31,090 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-13 13:41:31,090 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-13 13:41:31,090 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-13 13:41:31,090 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-13 13:41:31,090 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:31,090 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-13 13:41:31,090 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-13 13:41:31,090 INFO L132 ssoRankerPreferences]: Filename of dumped script: data_structures_set_multi_proc_trivial_ground.i_Iteration3_Loop [2024-11-13 13:41:31,090 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-13 13:41:31,090 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-13 13:41:31,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:31,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:31,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-13 13:41:31,139 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-13 13:41:31,140 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-13 13:41:31,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:31,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:31,145 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:31,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-13 13:41:31,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-13 13:41:31,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-13 13:41:31,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-13 13:41:31,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-13 13:41:31,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-13 13:41:31,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-13 13:41:31,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-13 13:41:31,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-13 13:41:31,176 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-13 13:41:31,183 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-11-13 13:41:31,184 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-11-13 13:41:31,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-13 13:41:31,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:31,187 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-13 13:41:31,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-13 13:41:31,189 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-13 13:41:31,190 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-13 13:41:31,190 INFO L474 LassoAnalysis]: Proved termination. [2024-11-13 13:41:31,190 INFO L476 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 [] [2024-11-13 13:41:31,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-13 13:41:31,211 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-13 13:41:31,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:31,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:41:31,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:41:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:31,259 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:41:31,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:41:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:31,285 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-13 13:41:31,285 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 45 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) [2024-11-13 13:41:31,319 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 45 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 39 states and 55 transitions. Complement of second has 5 states. [2024-11-13 13:41:31,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-13 13:41:31,324 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) [2024-11-13 13:41:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2024-11-13 13:41:31,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 3 letters. [2024-11-13 13:41:31,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 13:41:31,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 3 letters. [2024-11-13 13:41:31,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 13:41:31,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 6 letters. [2024-11-13 13:41:31,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-13 13:41:31,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 55 transitions. [2024-11-13 13:41:31,326 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2024-11-13 13:41:31,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 38 states and 53 transitions. [2024-11-13 13:41:31,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2024-11-13 13:41:31,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-13 13:41:31,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 53 transitions. [2024-11-13 13:41:31,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 13:41:31,327 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-13 13:41:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 53 transitions. [2024-11-13 13:41:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-13 13:41:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 36 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2024-11-13 13:41:31,330 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 52 transitions. [2024-11-13 13:41:31,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:31,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:41:31,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:41:31,333 INFO L87 Difference]: Start difference. First operand 37 states and 52 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) [2024-11-13 13:41:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:31,395 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2024-11-13 13:41:31,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 72 transitions. [2024-11-13 13:41:31,397 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 34 [2024-11-13 13:41:31,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 72 transitions. [2024-11-13 13:41:31,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-11-13 13:41:31,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-11-13 13:41:31,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 72 transitions. [2024-11-13 13:41:31,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 13:41:31,400 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 72 transitions. [2024-11-13 13:41:31,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 72 transitions. [2024-11-13 13:41:31,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2024-11-13 13:41:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2024-11-13 13:41:31,405 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-11-13 13:41:31,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:41:31,406 INFO L424 stractBuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2024-11-13 13:41:31,407 INFO L331 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-13 13:41:31,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2024-11-13 13:41:31,408 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2024-11-13 13:41:31,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:41:31,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:41:31,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-13 13:41:31,412 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 13:41:31,412 INFO L745 eck$LassoCheckResult]: Stem: 504#$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); 476#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#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; 477#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 499#L33-2 assume !(main_~x~0#1 < 100000); 500#L33-3 main_~x~0#1 := 0; 503#L39-2 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 473#L40-2 [2024-11-13 13:41:31,412 INFO L747 eck$LassoCheckResult]: Loop: 473#L40-2 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem5#1 := read~int#1(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem6#1 := read~int#1(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~mem5#1 != main_#t~mem6#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 485#L13 assume !(0 == __VERIFIER_assert_~cond#1); 472#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 473#L40-2 [2024-11-13 13:41:31,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:31,413 INFO L85 PathProgramCache]: Analyzing trace with hash 889656777, now seen corresponding path program 1 times [2024-11-13 13:41:31,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547067499] [2024-11-13 13:41:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:31,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:31,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:31,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547067499] [2024-11-13 13:41:31,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547067499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:41:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769882915] [2024-11-13 13:41:31,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:31,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:31,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:31,499 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:41:31,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 13:41:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:31,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:41:31,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:41:31,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:31,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:41:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:31,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769882915] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:41:31,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:41:31,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-13 13:41:31,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909661536] [2024-11-13 13:41:31,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:41:31,608 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 13:41:31,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:31,608 INFO L85 PathProgramCache]: Analyzing trace with hash 60031, now seen corresponding path program 1 times [2024-11-13 13:41:31,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:31,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346606171] [2024-11-13 13:41:31,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:31,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:31,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:41:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:31,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:41:31,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:31,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:41:31,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:41:31,731 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. cyclomatic complexity: 20 Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:31,865 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2024-11-13 13:41:31,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 147 transitions. [2024-11-13 13:41:31,867 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 67 [2024-11-13 13:41:31,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 111 states and 147 transitions. [2024-11-13 13:41:31,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2024-11-13 13:41:31,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2024-11-13 13:41:31,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 147 transitions. [2024-11-13 13:41:31,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-13 13:41:31,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 111 states and 147 transitions. [2024-11-13 13:41:31,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 147 transitions. [2024-11-13 13:41:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 40. [2024-11-13 13:41:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.35) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:31,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-11-13 13:41:31,874 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-11-13 13:41:31,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:41:31,877 INFO L424 stractBuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-11-13 13:41:31,877 INFO L331 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-13 13:41:31,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2024-11-13 13:41:31,878 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2024-11-13 13:41:31,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:41:31,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:41:31,878 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1] [2024-11-13 13:41:31,879 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-13 13:41:31,879 INFO L745 eck$LassoCheckResult]: Stem: 692#$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); 664#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#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; 665#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 687#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 688#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 695#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 694#L33-2 assume !(main_~x~0#1 < 100000); 693#L33-3 main_~x~0#1 := 0; 691#L39-2 assume !!(main_~x~0#1 < main_~n~0#1);main_~y~0#1 := 1 + main_~x~0#1; 661#L40-2 [2024-11-13 13:41:31,879 INFO L747 eck$LassoCheckResult]: Loop: 661#L40-2 assume !!(main_~y~0#1 < main_~n~0#1);call main_#t~mem5#1 := read~int#1(main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);call main_#t~mem6#1 := read~int#1(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~mem5#1 != main_#t~mem6#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 673#L13 assume !(0 == __VERIFIER_assert_~cond#1); 660#L13-3 havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem5#1;havoc main_#t~mem6#1;main_#t~post7#1 := main_~y~0#1;main_~y~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 661#L40-2 [2024-11-13 13:41:31,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:31,879 INFO L85 PathProgramCache]: Analyzing trace with hash -424925139, now seen corresponding path program 2 times [2024-11-13 13:41:31,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:31,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646060716] [2024-11-13 13:41:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:31,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 13:41:32,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:32,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646060716] [2024-11-13 13:41:32,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646060716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:41:32,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:41:32,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:41:32,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475110178] [2024-11-13 13:41:32,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:41:32,001 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 13:41:32,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:32,001 INFO L85 PathProgramCache]: Analyzing trace with hash 60031, now seen corresponding path program 2 times [2024-11-13 13:41:32,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:32,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731814893] [2024-11-13 13:41:32,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:32,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:32,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:41:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:32,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:41:32,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:32,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:41:32,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:41:32,128 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. cyclomatic complexity: 20 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:32,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:32,170 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2024-11-13 13:41:32,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2024-11-13 13:41:32,171 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2024-11-13 13:41:32,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 53 transitions. [2024-11-13 13:41:32,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-11-13 13:41:32,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-13 13:41:32,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 53 transitions. [2024-11-13 13:41:32,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:41:32,172 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-11-13 13:41:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 53 transitions. [2024-11-13 13:41:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-13 13:41:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2024-11-13 13:41:32,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-11-13 13:41:32,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:41:32,176 INFO L424 stractBuchiCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-11-13 13:41:32,176 INFO L331 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-13 13:41:32,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2024-11-13 13:41:32,176 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2024-11-13 13:41:32,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:41:32,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:41:32,177 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:32,177 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 13:41:32,177 INFO L745 eck$LassoCheckResult]: Stem: 776#$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); 750#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#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; 751#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 771#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 772#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 786#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 785#L33-2 assume !(main_~x~0#1 < 100000); 777#L33-3 main_~x~0#1 := 0; 775#L39-2 assume !(main_~x~0#1 < main_~n~0#1); 769#L39-3 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 763#L47-2 [2024-11-13 13:41:32,177 INFO L747 eck$LassoCheckResult]: Loop: 763#L47-2 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 763#L47-2 [2024-11-13 13:41:32,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:32,178 INFO L85 PathProgramCache]: Analyzing trace with hash -287777429, now seen corresponding path program 1 times [2024-11-13 13:41:32,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:32,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810120778] [2024-11-13 13:41:32,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:32,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:32,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2024-11-13 13:41:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:32,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:32,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810120778] [2024-11-13 13:41:32,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810120778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:41:32,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687516901] [2024-11-13 13:41:32,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:32,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:32,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:32,359 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:41:32,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 13:41:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:32,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:41:32,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:41:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:32,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:41:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:32,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687516901] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:41:32,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:41:32,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-13 13:41:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750299580] [2024-11-13 13:41:32,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:41:32,552 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 13:41:32,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:32,553 INFO L85 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 1 times [2024-11-13 13:41:32,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:32,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536592301] [2024-11-13 13:41:32,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:32,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:32,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:41:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:32,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:41:32,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:32,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 13:41:32,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-13 13:41:32,629 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. cyclomatic complexity: 17 Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:32,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:32,851 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2024-11-13 13:41:32,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 189 transitions. [2024-11-13 13:41:32,853 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 109 [2024-11-13 13:41:32,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 147 states and 189 transitions. [2024-11-13 13:41:32,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2024-11-13 13:41:32,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2024-11-13 13:41:32,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 189 transitions. [2024-11-13 13:41:32,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:41:32,860 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 189 transitions. [2024-11-13 13:41:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 189 transitions. [2024-11-13 13:41:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 47. [2024-11-13 13:41:32,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 46 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) [2024-11-13 13:41:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2024-11-13 13:41:32,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-11-13 13:41:32,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 13:41:32,869 INFO L424 stractBuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-11-13 13:41:32,871 INFO L331 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-13 13:41:32,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2024-11-13 13:41:32,872 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2024-11-13 13:41:32,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:41:32,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:41:32,872 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:32,872 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 13:41:32,872 INFO L745 eck$LassoCheckResult]: Stem: 1035#$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); 1008#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#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; 1009#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1029#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1030#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1047#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1046#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1045#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1044#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1043#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1042#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1041#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1040#L33-2 assume !(main_~x~0#1 < 100000); 1037#L33-3 main_~x~0#1 := 0; 1033#L39-2 assume !(main_~x~0#1 < main_~n~0#1); 1027#L39-3 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1021#L47-2 [2024-11-13 13:41:32,872 INFO L747 eck$LassoCheckResult]: Loop: 1021#L47-2 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1021#L47-2 [2024-11-13 13:41:32,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:32,873 INFO L85 PathProgramCache]: Analyzing trace with hash -855747861, now seen corresponding path program 2 times [2024-11-13 13:41:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:32,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118177952] [2024-11-13 13:41:32,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:33,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:33,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118177952] [2024-11-13 13:41:33,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118177952] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:41:33,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352120631] [2024-11-13 13:41:33,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:41:33,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:33,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:33,230 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:41:33,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 13:41:33,322 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:41:33,322 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:41:33,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 13:41:33,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:41:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:33,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:41:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:33,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352120631] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:41:33,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:41:33,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-13 13:41:33,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514705547] [2024-11-13 13:41:33,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:41:33,651 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 13:41:33,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 2 times [2024-11-13 13:41:33,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:33,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512424045] [2024-11-13 13:41:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:33,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:33,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:41:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:33,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:41:33,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:33,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 13:41:33,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-11-13 13:41:33,714 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. cyclomatic complexity: 17 Second operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:34,170 INFO L93 Difference]: Finished difference Result 279 states and 357 transitions. [2024-11-13 13:41:34,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 279 states and 357 transitions. [2024-11-13 13:41:34,173 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 205 [2024-11-13 13:41:34,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 279 states to 279 states and 357 transitions. [2024-11-13 13:41:34,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 257 [2024-11-13 13:41:34,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 257 [2024-11-13 13:41:34,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 279 states and 357 transitions. [2024-11-13 13:41:34,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:41:34,180 INFO L218 hiAutomatonCegarLoop]: Abstraction has 279 states and 357 transitions. [2024-11-13 13:41:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states and 357 transitions. [2024-11-13 13:41:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 59. [2024-11-13 13:41:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 58 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2024-11-13 13:41:34,190 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 71 transitions. [2024-11-13 13:41:34,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-13 13:41:34,194 INFO L424 stractBuchiCegarLoop]: Abstraction has 59 states and 71 transitions. [2024-11-13 13:41:34,194 INFO L331 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-13 13:41:34,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 71 transitions. [2024-11-13 13:41:34,195 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2024-11-13 13:41:34,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:41:34,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:41:34,195 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:34,195 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 13:41:34,196 INFO L745 eck$LassoCheckResult]: Stem: 1479#$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); 1452#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#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; 1453#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1473#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1474#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1503#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1502#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1501#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1500#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1499#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1498#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1497#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1496#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1495#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1494#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1493#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1492#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1491#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1490#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1489#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1488#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1487#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1486#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1485#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1484#L33-2 assume !(main_~x~0#1 < 100000); 1481#L33-3 main_~x~0#1 := 0; 1477#L39-2 assume !(main_~x~0#1 < main_~n~0#1); 1471#L39-3 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 1465#L47-2 [2024-11-13 13:41:34,196 INFO L747 eck$LassoCheckResult]: Loop: 1465#L47-2 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1465#L47-2 [2024-11-13 13:41:34,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:34,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1505156587, now seen corresponding path program 3 times [2024-11-13 13:41:34,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:34,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567141225] [2024-11-13 13:41:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:35,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:35,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567141225] [2024-11-13 13:41:35,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567141225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:41:35,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295253785] [2024-11-13 13:41:35,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:41:35,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:35,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:35,102 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:41:35,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-13 13:41:37,054 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-11-13 13:41:37,054 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:41:37,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-13 13:41:37,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:41:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:37,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:41:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:38,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295253785] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:41:38,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:41:38,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-11-13 13:41:38,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818976783] [2024-11-13 13:41:38,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:41:38,233 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 13:41:38,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:38,233 INFO L85 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 3 times [2024-11-13 13:41:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:38,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755922675] [2024-11-13 13:41:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:38,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:38,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:41:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:38,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:41:38,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:38,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-13 13:41:38,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-11-13 13:41:38,315 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. cyclomatic complexity: 17 Second operand has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:39,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:39,731 INFO L93 Difference]: Finished difference Result 543 states and 693 transitions. [2024-11-13 13:41:39,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 543 states and 693 transitions. [2024-11-13 13:41:39,736 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 397 [2024-11-13 13:41:39,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 543 states to 543 states and 693 transitions. [2024-11-13 13:41:39,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 497 [2024-11-13 13:41:39,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 497 [2024-11-13 13:41:39,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 543 states and 693 transitions. [2024-11-13 13:41:39,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:41:39,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 543 states and 693 transitions. [2024-11-13 13:41:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states and 693 transitions. [2024-11-13 13:41:39,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 83. [2024-11-13 13:41:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.144578313253012) internal successors, (95), 82 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:39,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2024-11-13 13:41:39,757 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 95 transitions. [2024-11-13 13:41:39,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-13 13:41:39,759 INFO L424 stractBuchiCegarLoop]: Abstraction has 83 states and 95 transitions. [2024-11-13 13:41:39,759 INFO L331 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-13 13:41:39,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 95 transitions. [2024-11-13 13:41:39,762 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2024-11-13 13:41:39,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:41:39,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:41:39,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:39,763 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 13:41:39,763 INFO L745 eck$LassoCheckResult]: Stem: 2294#$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); 2268#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#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; 2269#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2288#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2289#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2344#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2343#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2342#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2341#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2340#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2339#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2338#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2337#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2336#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2335#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2334#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2333#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2332#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2331#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2330#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2329#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2328#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2327#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2326#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2325#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2324#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2323#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2322#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2321#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2320#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2319#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2318#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2317#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2316#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2315#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2314#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2313#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2312#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2311#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2310#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2309#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2308#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2307#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2306#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2305#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2304#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2303#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2302#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2301#L33-2 assume !(main_~x~0#1 < 100000); 2297#L33-3 main_~x~0#1 := 0; 2292#L39-2 assume !(main_~x~0#1 < main_~n~0#1); 2286#L39-3 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 2281#L47-2 [2024-11-13 13:41:39,764 INFO L747 eck$LassoCheckResult]: Loop: 2281#L47-2 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 2281#L47-2 [2024-11-13 13:41:39,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:39,764 INFO L85 PathProgramCache]: Analyzing trace with hash -713133077, now seen corresponding path program 4 times [2024-11-13 13:41:39,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:39,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639648976] [2024-11-13 13:41:39,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:39,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:42,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:42,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639648976] [2024-11-13 13:41:42,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639648976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:41:42,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762239411] [2024-11-13 13:41:42,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 13:41:42,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:42,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:42,330 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:41:42,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-13 13:41:42,552 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 13:41:42,552 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:41:42,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-13 13:41:42,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:41:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:42,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:41:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:45,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762239411] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:41:45,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:41:45,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-11-13 13:41:45,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221052448] [2024-11-13 13:41:45,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:41:45,885 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-13 13:41:45,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash 93, now seen corresponding path program 4 times [2024-11-13 13:41:45,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:45,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456737655] [2024-11-13 13:41:45,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:45,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:45,891 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:41:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:41:45,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:41:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:41:45,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-11-13 13:41:45,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-11-13 13:41:45,960 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. cyclomatic complexity: 17 Second operand has 97 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:41:52,527 INFO L93 Difference]: Finished difference Result 1071 states and 1365 transitions. [2024-11-13 13:41:52,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1071 states and 1365 transitions. [2024-11-13 13:41:52,537 INFO L131 ngComponentsAnalysis]: Automaton has 98 accepting balls. 781 [2024-11-13 13:41:52,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1071 states to 1071 states and 1365 transitions. [2024-11-13 13:41:52,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 977 [2024-11-13 13:41:52,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 977 [2024-11-13 13:41:52,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1071 states and 1365 transitions. [2024-11-13 13:41:52,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-13 13:41:52,549 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1071 states and 1365 transitions. [2024-11-13 13:41:52,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states and 1365 transitions. [2024-11-13 13:41:52,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 131. [2024-11-13 13:41:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.0916030534351144) internal successors, (143), 130 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:41:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2024-11-13 13:41:52,570 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 143 transitions. [2024-11-13 13:41:52,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-13 13:41:52,571 INFO L424 stractBuchiCegarLoop]: Abstraction has 131 states and 143 transitions. [2024-11-13 13:41:52,571 INFO L331 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-13 13:41:52,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 143 transitions. [2024-11-13 13:41:52,573 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 29 [2024-11-13 13:41:52,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-13 13:41:52,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-13 13:41:52,576 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 1, 1, 1, 1, 1, 1] [2024-11-13 13:41:52,576 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-11-13 13:41:52,576 INFO L745 eck$LassoCheckResult]: Stem: 3855#$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); 3828#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~post4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~post8#1, main_#t~nondet9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~mem15#1, main_#t~mem16#1, main_#t~post17#1, main_#t~post18#1, main_#t~post19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~post22#1, main_#t~post23#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; 3829#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3849#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3850#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3951#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3950#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3949#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3948#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3947#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3946#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3945#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3944#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3943#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3942#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3941#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3940#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3939#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3938#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3937#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3936#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3935#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3934#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3933#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3932#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3931#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3930#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3929#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3928#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3927#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3926#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3925#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3924#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3923#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3922#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3921#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3920#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3919#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3918#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3917#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3916#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3915#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3914#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3913#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3912#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3911#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3910#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3909#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3908#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3907#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3906#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3905#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3904#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3903#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3902#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3901#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3900#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3899#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3898#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3897#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3896#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3895#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3894#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3893#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3892#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3891#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3890#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3889#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3888#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3887#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3886#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3885#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3884#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3883#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3882#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3881#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3880#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3879#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3878#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3877#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3876#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3875#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3874#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3873#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3872#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3871#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3870#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3869#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3868#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3867#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3866#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3865#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3864#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3863#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3862#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3861#L33-2 assume !!(main_~x~0#1 < 100000);havoc main_#t~nondet3#1;call write~int#1(main_#t~nondet3#1, main_~#set~0#1.base, main_~#set~0#1.offset + 4 * main_~x~0#1, 4);havoc main_#t~nondet3#1;main_#t~post4#1 := main_~x~0#1;main_~x~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3860#L33-2 assume !(main_~x~0#1 < 100000); 3857#L33-3 main_~x~0#1 := 0; 3853#L39-2 assume !(main_~x~0#1 < main_~n~0#1); 3847#L39-3 call main_~#values~0#1.base, main_~#values~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~v~0#1;main_~v~0#1 := 0; 3841#L47-2 [2024-11-13 13:41:52,577 INFO L747 eck$LassoCheckResult]: Loop: 3841#L47-2 assume !!(main_~v~0#1 < 100000);havoc main_#t~nondet9#1;call write~int#2(main_#t~nondet9#1, main_~#values~0#1.base, main_~#values~0#1.offset + 4 * main_~v~0#1, 4);havoc main_#t~nondet9#1;main_#t~post10#1 := main_~v~0#1;main_~v~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 3841#L47-2 [2024-11-13 13:41:52,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:41:52,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1265082347, now seen corresponding path program 5 times [2024-11-13 13:41:52,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:41:52,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056816426] [2024-11-13 13:41:52,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:41:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:41:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:41:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:41:59,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:41:59,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056816426] [2024-11-13 13:41:59,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056816426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:41:59,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868447074] [2024-11-13 13:41:59,379 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 13:41:59,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:41:59,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:41:59,381 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:41:59,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95e7b732-f273-4606-b346-80b572f0e900/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process