./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sum10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sum10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya --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 f341d659968a9193c951bd8eec2bcf2a384f8494a1f57cb579da98ce5ebdb030 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:05:33,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:05:33,749 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-29 06:05:33,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:05:33,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:05:33,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:05:33,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:05:33,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:05:33,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:05:33,782 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:05:33,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:05:33,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:05:33,784 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:05:33,784 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-29 06:05:33,785 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-29 06:05:33,785 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-29 06:05:33,786 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-29 06:05:33,786 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-29 06:05:33,787 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-29 06:05:33,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:05:33,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-29 06:05:33,792 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:05:33,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:05:33,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:05:33,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:05:33,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-29 06:05:33,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-29 06:05:33,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-29 06:05:33,794 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:05:33,795 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:05:33,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:05:33,796 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-29 06:05:33,796 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:05:33,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:05:33,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:05:33,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:05:33,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:05:33,797 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-29 06:05:33,798 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya 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 -> f341d659968a9193c951bd8eec2bcf2a384f8494a1f57cb579da98ce5ebdb030 [2023-11-29 06:05:34,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:05:34,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:05:34,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:05:34,038 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:05:34,039 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:05:34,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/reducercommutativity/sum10-1.i [2023-11-29 06:05:36,787 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:05:36,979 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:05:36,979 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/sv-benchmarks/c/reducercommutativity/sum10-1.i [2023-11-29 06:05:36,985 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/data/b96f63671/7727fc7a926d4d97ba4f5dc3ec17c3a7/FLAG4a9f59416 [2023-11-29 06:05:36,996 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/data/b96f63671/7727fc7a926d4d97ba4f5dc3ec17c3a7 [2023-11-29 06:05:36,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:05:37,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:05:37,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:05:37,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:05:37,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:05:37,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:05:36" (1/1) ... [2023-11-29 06:05:37,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17acf968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37, skipping insertion in model container [2023-11-29 06:05:37,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:05:36" (1/1) ... [2023-11-29 06:05:37,025 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:05:37,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:05:37,174 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:05:37,192 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:05:37,206 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:05:37,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37 WrapperNode [2023-11-29 06:05:37,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:05:37,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:05:37,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:05:37,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:05:37,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37" (1/1) ... [2023-11-29 06:05:37,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37" (1/1) ... [2023-11-29 06:05:37,238 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2023-11-29 06:05:37,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:05:37,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:05:37,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:05:37,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:05:37,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37" (1/1) ... [2023-11-29 06:05:37,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37" (1/1) ... [2023-11-29 06:05:37,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37" (1/1) ... [2023-11-29 06:05:37,261 INFO L175 MemorySlicer]: Split 14 memory accesses to 2 slices as follows [2, 12]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2023-11-29 06:05:37,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37" (1/1) ... [2023-11-29 06:05:37,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37" (1/1) ... [2023-11-29 06:05:37,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37" (1/1) ... [2023-11-29 06:05:37,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37" (1/1) ... [2023-11-29 06:05:37,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37" (1/1) ... [2023-11-29 06:05:37,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37" (1/1) ... [2023-11-29 06:05:37,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:05:37,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:05:37,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:05:37,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:05:37,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37" (1/1) ... [2023-11-29 06:05:37,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:37,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:37,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:37,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-29 06:05:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:05:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:05:37,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:05:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:05:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:05:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:05:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:05:37,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:05:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:05:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:05:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:05:37,420 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:05:37,423 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:05:37,595 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:05:37,604 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:05:37,605 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 06:05:37,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:05:37 BoogieIcfgContainer [2023-11-29 06:05:37,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:05:37,608 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-29 06:05:37,608 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-29 06:05:37,612 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-29 06:05:37,613 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 06:05:37,613 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 06:05:36" (1/3) ... [2023-11-29 06:05:37,614 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a45a6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 06:05:37, skipping insertion in model container [2023-11-29 06:05:37,614 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 06:05:37,614 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:05:37" (2/3) ... [2023-11-29 06:05:37,614 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a45a6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 06:05:37, skipping insertion in model container [2023-11-29 06:05:37,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-29 06:05:37,615 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:05:37" (3/3) ... [2023-11-29 06:05:37,616 INFO L332 chiAutomizerObserver]: Analyzing ICFG sum10-1.i [2023-11-29 06:05:37,670 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-29 06:05:37,670 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-29 06:05:37,670 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-29 06:05:37,671 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-29 06:05:37,671 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-29 06:05:37,671 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-29 06:05:37,671 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-29 06:05:37,671 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-29 06:05:37,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:37,694 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-11-29 06:05:37,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:05:37,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:05:37,699 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:05:37,699 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 06:05:37,699 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-29 06:05:37,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:37,702 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-11-29 06:05:37,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:05:37,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:05:37,703 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-29 06:05:37,703 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 06:05:37,711 INFO L748 eck$LassoCheckResult]: Stem: 25#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 17#L34-3true [2023-11-29 06:05:37,711 INFO L750 eck$LassoCheckResult]: Loop: 17#L34-3true assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 13#L34-2true main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 17#L34-3true [2023-11-29 06:05:37,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:37,717 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-29 06:05:37,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:37,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231607811] [2023-11-29 06:05:37,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:37,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:37,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:37,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:37,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:37,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-29 06:05:37,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:37,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028367782] [2023-11-29 06:05:37,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:37,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:37,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:37,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:37,871 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-29 06:05:37,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:37,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144545823] [2023-11-29 06:05:37,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:37,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:37,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:37,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:38,218 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 06:05:38,219 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 06:05:38,219 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 06:05:38,219 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 06:05:38,219 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 06:05:38,219 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:38,219 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 06:05:38,219 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 06:05:38,220 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration1_Lasso [2023-11-29 06:05:38,220 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 06:05:38,220 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 06:05:38,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,294 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:38,670 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 06:05:38,674 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 06:05:38,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:38,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:38,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:38,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-29 06:05:38,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:38,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:38,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:38,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:38,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:38,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:38,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:38,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:38,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:38,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:05:38,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:38,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:38,714 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:38,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-29 06:05:38,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:38,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:38,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:38,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:38,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:38,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:38,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:38,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:38,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:38,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-11-29 06:05:38,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:38,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:38,735 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:38,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-29 06:05:38,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:38,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:38,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:38,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:38,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:38,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:38,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:38,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:38,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:38,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-29 06:05:38,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:38,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:38,757 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:38,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-29 06:05:38,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:38,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:38,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:38,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:38,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:38,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:05:38,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:05:38,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:38,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-11-29 06:05:38,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:38,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:38,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:38,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-29 06:05:38,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:38,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:38,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:38,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:38,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:38,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:05:38,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:05:38,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:38,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-11-29 06:05:38,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:38,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:38,816 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:38,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-29 06:05:38,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:38,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:38,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:38,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:38,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:38,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:38,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:38,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:38,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:38,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-11-29 06:05:38,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:38,841 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:38,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-29 06:05:38,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:38,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:38,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:38,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:38,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:38,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:38,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:38,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:38,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:38,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-11-29 06:05:38,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:38,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:38,864 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:38,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-29 06:05:38,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:38,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:38,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:38,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:38,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:38,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:38,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:38,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:38,885 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:38,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-11-29 06:05:38,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:38,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:38,890 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:38,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-29 06:05:38,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:38,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:38,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:38,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:38,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:38,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:38,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:38,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:38,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:38,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-11-29 06:05:38,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:38,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:38,919 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:38,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-29 06:05:38,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:38,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:38,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:38,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:38,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:38,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:38,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:38,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:38,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:38,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2023-11-29 06:05:38,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:38,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:38,967 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:38,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-29 06:05:38,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:38,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:38,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:38,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:38,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:38,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:38,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:38,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:38,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:38,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-11-29 06:05:38,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:38,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:38,989 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:38,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-29 06:05:38,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:39,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:39,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:39,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:39,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:39,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:39,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:39,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:39,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:39,011 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-11-29 06:05:39,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:39,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:39,013 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:39,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-29 06:05:39,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:39,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:39,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:39,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:39,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:39,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:39,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:39,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:39,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:39,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-11-29 06:05:39,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:39,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:39,040 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:39,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-29 06:05:39,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 [2023-11-29 06:05:39,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:39,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:39,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:39,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:39,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:39,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:39,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:39,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:39,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-11-29 06:05:39,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:39,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:39,071 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:39,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-29 06:05:39,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:39,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:39,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:39,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:39,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:39,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:39,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:39,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:39,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:39,094 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-11-29 06:05:39,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:39,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:39,096 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:39,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-29 06:05:39,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:39,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:39,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:39,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:39,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:39,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:39,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:39,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:39,114 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:39,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-11-29 06:05:39,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:39,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:39,119 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:39,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-29 06:05:39,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:39,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:39,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:39,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:39,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:39,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:39,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:39,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:39,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:39,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-11-29 06:05:39,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:39,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:39,138 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:39,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-29 06:05:39,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:39,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:39,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:39,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:39,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:39,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:05:39,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:05:39,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:39,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-11-29 06:05:39,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:39,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:39,164 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:39,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-29 06:05:39,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:39,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:39,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:39,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:39,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:39,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:05:39,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:05:39,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:39,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-11-29 06:05:39,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:39,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:39,195 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:39,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-29 06:05:39,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:39,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:39,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:39,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:39,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:39,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:05:39,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:05:39,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:39,222 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-11-29 06:05:39,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:39,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:39,224 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:39,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-29 06:05:39,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:39,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:39,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:39,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:39,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:39,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:05:39,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:05:39,255 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 06:05:39,276 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-11-29 06:05:39,276 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-11-29 06:05:39,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:39,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:39,302 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:39,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-29 06:05:39,303 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 06:05:39,317 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 06:05:39,317 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 06:05:39,318 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_1 - 8*ULTIMATE.start_main_~i~1#1 Supporting invariants [] [2023-11-29 06:05:39,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-11-29 06:05:39,337 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-11-29 06:05:39,345 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#x~0!base] could not be translated [2023-11-29 06:05:39,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:39,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:05:39,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:05:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:39,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:05:39,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:05:39,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:05:39,455 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-29 06:05:39,457 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:39,501 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 77 transitions. Complement of second has 8 states. [2023-11-29 06:05:39,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 06:05:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2023-11-29 06:05:39,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-29 06:05:39,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:05:39,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-29 06:05:39,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:05:39,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-29 06:05:39,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:05:39,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 77 transitions. [2023-11-29 06:05:39,513 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-29 06:05:39,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 19 states and 27 transitions. [2023-11-29 06:05:39,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-11-29 06:05:39,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-11-29 06:05:39,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2023-11-29 06:05:39,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:05:39,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2023-11-29 06:05:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2023-11-29 06:05:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-29 06:05:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2023-11-29 06:05:39,537 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2023-11-29 06:05:39,537 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2023-11-29 06:05:39,537 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-29 06:05:39,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2023-11-29 06:05:39,538 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-29 06:05:39,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:05:39,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:05:39,538 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-29 06:05:39,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 06:05:39,539 INFO L748 eck$LassoCheckResult]: Stem: 153#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 146#L34-3 assume !(main_~i~1#1 < 10); 138#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 139#L20-3 [2023-11-29 06:05:39,539 INFO L750 eck$LassoCheckResult]: Loop: 139#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 152#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 139#L20-3 [2023-11-29 06:05:39,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2023-11-29 06:05:39,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:39,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382995308] [2023-11-29 06:05:39,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:39,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:05:39,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:05:39,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382995308] [2023-11-29 06:05:39,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382995308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:05:39,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:05:39,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:05:39,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626715523] [2023-11-29 06:05:39,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:05:39,601 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 06:05:39,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:39,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2023-11-29 06:05:39,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:39,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972938846] [2023-11-29 06:05:39,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:39,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:39,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:39,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:39,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:05:39,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:05:39,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:05:39,660 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:39,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:05:39,671 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2023-11-29 06:05:39,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2023-11-29 06:05:39,673 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-29 06:05:39,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2023-11-29 06:05:39,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-11-29 06:05:39,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-11-29 06:05:39,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2023-11-29 06:05:39,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:05:39,674 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-29 06:05:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2023-11-29 06:05:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2023-11-29 06:05:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-11-29 06:05:39,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-11-29 06:05:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:05:39,677 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-11-29 06:05:39,678 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-29 06:05:39,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2023-11-29 06:05:39,678 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-29 06:05:39,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:05:39,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:05:39,679 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-29 06:05:39,679 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 06:05:39,679 INFO L748 eck$LassoCheckResult]: Stem: 198#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 191#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 194#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 195#L34-3 assume !(main_~i~1#1 < 10); 183#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 184#L20-3 [2023-11-29 06:05:39,679 INFO L750 eck$LassoCheckResult]: Loop: 184#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 197#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 184#L20-3 [2023-11-29 06:05:39,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2023-11-29 06:05:39,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:39,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018053957] [2023-11-29 06:05:39,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:39,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:05:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:05:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018053957] [2023-11-29 06:05:39,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018053957] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:05:39,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566621938] [2023-11-29 06:05:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:39,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:05:39,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:39,735 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:05:39,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-29 06:05:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:39,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:05:39,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:05:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:05:39,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:05:39,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:05:39,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566621938] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:05:39,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:05:39,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-29 06:05:39,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978877635] [2023-11-29 06:05:39,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:05:39,821 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 06:05:39,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:39,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2023-11-29 06:05:39,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:39,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745734757] [2023-11-29 06:05:39,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:39,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:39,827 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:39,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:39,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:05:39,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:05:39,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:05:39,878 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:39,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:05:39,905 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-11-29 06:05:39,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2023-11-29 06:05:39,906 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-29 06:05:39,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 29 transitions. [2023-11-29 06:05:39,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-11-29 06:05:39,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-11-29 06:05:39,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2023-11-29 06:05:39,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:05:39,908 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-29 06:05:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2023-11-29 06:05:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-29 06:05:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-11-29 06:05:39,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-29 06:05:39,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:05:39,912 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-29 06:05:39,912 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-29 06:05:39,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2023-11-29 06:05:39,913 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-29 06:05:39,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:05:39,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:05:39,914 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2023-11-29 06:05:39,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 06:05:39,914 INFO L748 eck$LassoCheckResult]: Stem: 282#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 275#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 283#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 284#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 278#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 279#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 288#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 287#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 286#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 285#L34-3 assume !(main_~i~1#1 < 10); 267#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 268#L20-3 [2023-11-29 06:05:39,914 INFO L750 eck$LassoCheckResult]: Loop: 268#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 281#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 268#L20-3 [2023-11-29 06:05:39,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:39,915 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2023-11-29 06:05:39,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:39,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096763966] [2023-11-29 06:05:39,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:39,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:39,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-11-29 06:05:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:05:40,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:05:40,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096763966] [2023-11-29 06:05:40,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096763966] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:05:40,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278920948] [2023-11-29 06:05:40,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:05:40,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:05:40,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:40,058 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:05:40,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-29 06:05:40,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:05:40,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:05:40,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:05:40,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:05:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:05:40,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:05:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:05:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278920948] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:05:40,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:05:40,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-29 06:05:40,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391021599] [2023-11-29 06:05:40,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:05:40,223 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 06:05:40,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2023-11-29 06:05:40,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:40,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288973949] [2023-11-29 06:05:40,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:40,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:40,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:40,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:05:40,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:05:40,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:05:40,281 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:05:40,327 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2023-11-29 06:05:40,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2023-11-29 06:05:40,329 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-29 06:05:40,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2023-11-29 06:05:40,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-11-29 06:05:40,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-11-29 06:05:40,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2023-11-29 06:05:40,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:05:40,330 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-11-29 06:05:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2023-11-29 06:05:40,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-29 06:05:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-11-29 06:05:40,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-11-29 06:05:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:05:40,335 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-11-29 06:05:40,335 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-29 06:05:40,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2023-11-29 06:05:40,337 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-29 06:05:40,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:05:40,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:05:40,338 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2023-11-29 06:05:40,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 06:05:40,338 INFO L748 eck$LassoCheckResult]: Stem: 426#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 418#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 419#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 427#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 428#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 422#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 423#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 444#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 443#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 442#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 441#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 440#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 439#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 438#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 437#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 436#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 435#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 434#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 433#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 432#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 431#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 430#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 429#L34-3 assume !(main_~i~1#1 < 10); 411#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 412#L20-3 [2023-11-29 06:05:40,338 INFO L750 eck$LassoCheckResult]: Loop: 412#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 425#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 412#L20-3 [2023-11-29 06:05:40,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:40,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2023-11-29 06:05:40,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:40,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020792776] [2023-11-29 06:05:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:40,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:40,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:40,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:40,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:40,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2023-11-29 06:05:40,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:40,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425365516] [2023-11-29 06:05:40,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:40,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:40,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:40,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:40,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:40,406 INFO L85 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2023-11-29 06:05:40,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:40,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440041745] [2023-11-29 06:05:40,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:40,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:40,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:40,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:45,521 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 06:05:45,521 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 06:05:45,522 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 06:05:45,522 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 06:05:45,522 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 06:05:45,522 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:45,522 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 06:05:45,522 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 06:05:45,522 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration5_Lasso [2023-11-29 06:05:45,522 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 06:05:45,522 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 06:05:45,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:45,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:46,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:05:46,229 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-29 06:05:46,229 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-29 06:05:46,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:46,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:46,230 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:46,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-29 06:05:46,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:46,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:46,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-29 06:05:46,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:46,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:46,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:46,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-29 06:05:46,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-29 06:05:46,249 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-29 06:05:46,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-11-29 06:05:46,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:46,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:46,252 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:46,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-29 06:05:46,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-29 06:05:46,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-29 06:05:46,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-29 06:05:46,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-29 06:05:46,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-29 06:05:46,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-29 06:05:46,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-29 06:05:46,280 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-29 06:05:46,309 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-11-29 06:05:46,309 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2023-11-29 06:05:46,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:05:46,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:46,311 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-29 06:05:46,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-29 06:05:46,312 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-29 06:05:46,323 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-29 06:05:46,324 INFO L513 LassoAnalysis]: Proved termination. [2023-11-29 06:05:46,324 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0#1) = -2*ULTIMATE.start_sum_~i~0#1 + 19 Supporting invariants [] [2023-11-29 06:05:46,326 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-11-29 06:05:46,341 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2023-11-29 06:05:46,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:46,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:05:46,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:05:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:46,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:05:46,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:05:46,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:05:46,428 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-29 06:05:46,428 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:46,445 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 48 transitions. Complement of second has 7 states. [2023-11-29 06:05:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-29 06:05:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2023-11-29 06:05:46,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 2 letters. [2023-11-29 06:05:46,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:05:46,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 26 letters. Loop has 2 letters. [2023-11-29 06:05:46,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:05:46,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 4 letters. [2023-11-29 06:05:46,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-29 06:05:46,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2023-11-29 06:05:46,449 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-29 06:05:46,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 43 transitions. [2023-11-29 06:05:46,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2023-11-29 06:05:46,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-11-29 06:05:46,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2023-11-29 06:05:46,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:05:46,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-11-29 06:05:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2023-11-29 06:05:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-29 06:05:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.131578947368421) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-11-29 06:05:46,454 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-11-29 06:05:46,454 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-11-29 06:05:46,454 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-29 06:05:46,454 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2023-11-29 06:05:46,455 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-29 06:05:46,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:05:46,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:05:46,455 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:05:46,456 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 06:05:46,456 INFO L748 eck$LassoCheckResult]: Stem: 638#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 629#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 630#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 639#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 640#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 633#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 634#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 656#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 655#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 654#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 653#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 652#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 651#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 650#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 649#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 648#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 647#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 646#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 645#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 644#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 643#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 642#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 641#L34-3 assume !(main_~i~1#1 < 10); 622#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 623#L20-3 assume !(sum_~i~0#1 < 10); 631#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 632#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 627#L20-8 [2023-11-29 06:05:46,456 INFO L750 eck$LassoCheckResult]: Loop: 627#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 628#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 627#L20-8 [2023-11-29 06:05:46,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:46,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2023-11-29 06:05:46,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:46,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417474182] [2023-11-29 06:05:46,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:46,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 06:05:46,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:05:46,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417474182] [2023-11-29 06:05:46,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417474182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:05:46,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:05:46,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:05:46,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964192883] [2023-11-29 06:05:46,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:05:46,541 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 06:05:46,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:46,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2023-11-29 06:05:46,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:46,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146623821] [2023-11-29 06:05:46,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:46,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:46,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:46,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:46,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:05:46,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:05:46,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:05:46,590 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:05:46,613 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2023-11-29 06:05:46,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2023-11-29 06:05:46,614 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-29 06:05:46,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2023-11-29 06:05:46,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-11-29 06:05:46,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-11-29 06:05:46,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2023-11-29 06:05:46,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:05:46,615 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-11-29 06:05:46,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2023-11-29 06:05:46,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2023-11-29 06:05:46,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-11-29 06:05:46,618 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-11-29 06:05:46,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:05:46,619 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-11-29 06:05:46,619 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-29 06:05:46,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2023-11-29 06:05:46,620 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-29 06:05:46,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:05:46,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:05:46,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:05:46,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 06:05:46,621 INFO L748 eck$LassoCheckResult]: Stem: 725#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 716#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 717#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 720#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 721#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 727#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 744#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 743#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 742#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 741#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 740#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 739#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 738#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 737#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 736#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 735#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 734#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 733#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 732#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 731#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 730#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 729#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 728#L34-3 assume !(main_~i~1#1 < 10); 709#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 710#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 723#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 724#L20-3 assume !(sum_~i~0#1 < 10); 718#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 719#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 714#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 715#L20-7 [2023-11-29 06:05:46,621 INFO L750 eck$LassoCheckResult]: Loop: 715#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 726#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 715#L20-7 [2023-11-29 06:05:46,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:46,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2023-11-29 06:05:46,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:46,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232310076] [2023-11-29 06:05:46,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:46,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 06:05:46,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:05:46,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232310076] [2023-11-29 06:05:46,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232310076] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:05:46,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359964816] [2023-11-29 06:05:46,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:46,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:05:46,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:46,709 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:05:46,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-29 06:05:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:46,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:05:46,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:05:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 06:05:46,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:05:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 06:05:46,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359964816] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:05:46,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:05:46,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-29 06:05:46,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255172652] [2023-11-29 06:05:46,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:05:46,841 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 06:05:46,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:46,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2023-11-29 06:05:46,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:46,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273666732] [2023-11-29 06:05:46,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:46,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:46,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:46,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:46,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:05:46,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 06:05:46,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:05:46,893 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:05:46,963 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2023-11-29 06:05:46,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2023-11-29 06:05:46,964 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-29 06:05:46,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 62 transitions. [2023-11-29 06:05:46,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-11-29 06:05:46,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-11-29 06:05:46,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 62 transitions. [2023-11-29 06:05:46,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:05:46,966 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 62 transitions. [2023-11-29 06:05:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 62 transitions. [2023-11-29 06:05:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2023-11-29 06:05:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2023-11-29 06:05:46,989 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 55 transitions. [2023-11-29 06:05:46,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-11-29 06:05:46,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:05:46,992 INFO L428 stractBuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2023-11-29 06:05:46,992 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-29 06:05:46,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2023-11-29 06:05:46,993 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-29 06:05:46,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:05:46,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:05:46,994 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:05:46,994 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 06:05:46,994 INFO L748 eck$LassoCheckResult]: Stem: 1007#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 997#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 998#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1009#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1010#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1001#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1002#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1037#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1036#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1035#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1034#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1033#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1032#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1031#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1030#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1029#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1028#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1027#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1026#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1025#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1024#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1023#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1022#L34-3 assume !(main_~i~1#1 < 10); 990#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 991#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1004#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1005#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1006#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1021#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1020#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1018#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1015#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1014#L20-3 assume !(sum_~i~0#1 < 10); 999#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1000#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 995#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 996#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1008#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1019#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1017#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1016#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1013#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1012#L20-7 [2023-11-29 06:05:46,995 INFO L750 eck$LassoCheckResult]: Loop: 1012#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1011#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1012#L20-7 [2023-11-29 06:05:46,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:46,995 INFO L85 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 1 times [2023-11-29 06:05:46,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:46,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279096770] [2023-11-29 06:05:46,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:46,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-11-29 06:05:47,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:05:47,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279096770] [2023-11-29 06:05:47,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279096770] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:05:47,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730168325] [2023-11-29 06:05:47,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:47,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:05:47,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:47,150 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:05:47,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-29 06:05:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:47,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:05:47,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:05:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-11-29 06:05:47,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:05:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-11-29 06:05:47,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730168325] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:05:47,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 06:05:47,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-29 06:05:47,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7552510] [2023-11-29 06:05:47,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 06:05:47,345 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-29 06:05:47,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:47,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2023-11-29 06:05:47,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:47,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508377129] [2023-11-29 06:05:47,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:47,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:47,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:47,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:47,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:05:47,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:05:47,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:05:47,395 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:05:47,527 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2023-11-29 06:05:47,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2023-11-29 06:05:47,528 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-29 06:05:47,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2023-11-29 06:05:47,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2023-11-29 06:05:47,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2023-11-29 06:05:47,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2023-11-29 06:05:47,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:05:47,530 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 98 transitions. [2023-11-29 06:05:47,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2023-11-29 06:05:47,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2023-11-29 06:05:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 74 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2023-11-29 06:05:47,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 79 transitions. [2023-11-29 06:05:47,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:05:47,537 INFO L428 stractBuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2023-11-29 06:05:47,537 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-29 06:05:47,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2023-11-29 06:05:47,538 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-29 06:05:47,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:05:47,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:05:47,540 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:05:47,540 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 06:05:47,540 INFO L748 eck$LassoCheckResult]: Stem: 1414#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1404#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1405#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1408#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1409#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1416#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1468#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1467#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1466#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1465#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1464#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1463#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1462#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1461#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1460#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1459#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1458#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1457#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1456#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1455#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1454#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1453#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1452#L34-3 assume !(main_~i~1#1 < 10); 1397#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1398#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1411#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1412#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1413#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1451#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1450#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1448#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1446#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1444#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1442#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1440#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1438#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1436#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1434#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1432#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1430#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1428#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1426#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1424#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1421#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1420#L20-3 assume !(sum_~i~0#1 < 10); 1406#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1407#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1402#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1403#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1415#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1449#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1447#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1445#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1443#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1441#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1439#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1437#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1435#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1433#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1431#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1429#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1427#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1425#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1423#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1422#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1419#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1418#L20-7 [2023-11-29 06:05:47,541 INFO L750 eck$LassoCheckResult]: Loop: 1418#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1417#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1418#L20-7 [2023-11-29 06:05:47,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 2 times [2023-11-29 06:05:47,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:47,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666650108] [2023-11-29 06:05:47,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:47,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:47,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:47,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:47,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2023-11-29 06:05:47,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:47,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408776842] [2023-11-29 06:05:47,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:47,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:47,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:47,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:47,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 3 times [2023-11-29 06:05:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:47,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356836313] [2023-11-29 06:05:47,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:47,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:05:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 81 proven. 19 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-11-29 06:05:48,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:05:48,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356836313] [2023-11-29 06:05:48,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356836313] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:05:48,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809219936] [2023-11-29 06:05:48,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:05:48,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 06:05:48,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:05:48,059 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 06:05:48,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_308abbda-357a-4bb7-a179-35f3fb9e4791/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-11-29 06:05:48,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-29 06:05:48,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:05:48,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 06:05:48,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:05:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-11-29 06:05:48,428 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:05:48,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809219936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:05:48,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:05:48,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2023-11-29 06:05:48,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357954530] [2023-11-29 06:05:48,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:05:48,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:05:48,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:05:48,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:05:48,470 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 9 Second operand has 13 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:05:48,683 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2023-11-29 06:05:48,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2023-11-29 06:05:48,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 06:05:48,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2023-11-29 06:05:48,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2023-11-29 06:05:48,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2023-11-29 06:05:48,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2023-11-29 06:05:48,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 06:05:48,686 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2023-11-29 06:05:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2023-11-29 06:05:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-29 06:05:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:05:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2023-11-29 06:05:48,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2023-11-29 06:05:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:05:48,692 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2023-11-29 06:05:48,692 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-29 06:05:48,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2023-11-29 06:05:48,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-29 06:05:48,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-29 06:05:48,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-29 06:05:48,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:05:48,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-29 06:05:48,695 INFO L748 eck$LassoCheckResult]: Stem: 1801#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); 1791#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post3#1, main_~i~1#1, main_#t~ret5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~ret8#1, main_#t~mem9#1, main_#t~mem11#1, main_#t~post10#1, main_~i~2#1, main_#t~ret12#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(40);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 1792#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1795#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1796#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1803#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1839#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1837#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1835#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1834#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1833#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1832#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1830#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1828#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1826#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1824#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1822#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1820#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1818#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1816#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1814#L34-3 assume !!(main_~i~1#1 < 10);havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet4#1; 1811#L34-2 main_#t~post3#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1810#L34-3 assume !(main_~i~1#1 < 10); 1786#L34-4 havoc main_~i~1#1;assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1787#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1800#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1798#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1799#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1854#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1853#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1852#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1851#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1850#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1849#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1848#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1847#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1846#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1845#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1844#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1843#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1842#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1841#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1840#L20-3 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1838#L20-2 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1836#L20-3 assume !(sum_~i~0#1 < 10); 1793#L20-4 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1794#sum_returnLabel#1 main_#t~ret5#1 := sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret~1#1 := main_#t~ret5#1;havoc main_#t~ret5#1;call main_#t~mem6#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;call main_#t~mem7#1 := read~int#1(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int#1(main_#t~mem7#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem7#1;call write~int#1(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_sum } true;sum_#in~x#1.base, sum_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;sum_~x#1.base, sum_~x#1.offset := sum_#in~x#1.base, sum_#in~x#1.offset;havoc sum_~i~0#1;havoc sum_~ret~0#1;sum_~ret~0#1 := 0;sum_~i~0#1 := 0; 1797#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1802#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1789#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1790#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1831#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1829#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1827#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1825#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1823#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1821#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1819#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1817#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1815#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1813#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1812#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1809#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1808#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1807#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1806#L20-8 assume !!(sum_~i~0#1 < 10);call sum_#t~mem2#1 := read~int#1(sum_~x#1.base, sum_~x#1.offset + 4 * sum_~i~0#1, 4);sum_~ret~0#1 := sum_~ret~0#1 + sum_#t~mem2#1;havoc sum_#t~mem2#1; 1805#L20-7 sum_#t~post1#1 := sum_~i~0#1;sum_~i~0#1 := 1 + sum_#t~post1#1;havoc sum_#t~post1#1; 1804#L20-8 assume !(sum_~i~0#1 < 10); 1785#L20-9 sum_#res#1 := (if sum_~ret~0#1 % 4294967296 <= 2147483647 then sum_~ret~0#1 % 4294967296 else sum_~ret~0#1 % 4294967296 - 4294967296); 1783#sum_returnLabel#2 main_#t~ret8#1 := sum_#res#1;havoc sum_#t~mem2#1, sum_#t~post1#1, sum_~x#1.base, sum_~x#1.offset, sum_~i~0#1, sum_~ret~0#1;havoc sum_#in~x#1.base, sum_#in~x#1.offset;assume { :end_inline_sum } true;main_~ret2~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;call main_#t~mem9#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem9#1;havoc main_#t~mem9#1;main_~i~2#1 := 0; 1784#L43-3 [2023-11-29 06:05:48,696 INFO L750 eck$LassoCheckResult]: Loop: 1784#L43-3 assume !!(main_~i~2#1 < 9);call main_#t~mem11#1 := read~int#1(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~2#1), 4);call write~int#1(main_#t~mem11#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~mem11#1; 1788#L43-2 main_#t~post10#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; 1784#L43-3 [2023-11-29 06:05:48,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2023-11-29 06:05:48,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:48,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030745289] [2023-11-29 06:05:48,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:48,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:48,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:48,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:48,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2023-11-29 06:05:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:48,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18544605] [2023-11-29 06:05:48,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:48,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:48,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:48,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:05:48,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:05:48,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1072398385, now seen corresponding path program 1 times [2023-11-29 06:05:48,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:05:48,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698793790] [2023-11-29 06:05:48,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:05:48,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:05:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:49,042 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:05:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:05:49,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:06:14,036 WARN L293 SmtUtils]: Spent 24.84s on a formula simplification. DAG size of input: 535 DAG size of output: 397 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-29 06:06:15,741 INFO L210 LassoAnalysis]: Preferences: [2023-11-29 06:06:15,741 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-29 06:06:15,741 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-29 06:06:15,741 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-29 06:06:15,741 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-29 06:06:15,741 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-29 06:06:15,742 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-29 06:06:15,742 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-29 06:06:15,742 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration10_Lasso [2023-11-29 06:06:15,742 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-29 06:06:15,742 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-29 06:06:15,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:06:15,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-29 06:06:15,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true