./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 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sum10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f341d659968a9193c951bd8eec2bcf2a384f8494a1f57cb579da98ce5ebdb030 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:17:00,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:17:00,384 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-21 22:17:00,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:17:00,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:17:00,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:17:00,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:17:00,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:17:00,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:17:00,418 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:17:00,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:17:00,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:17:00,421 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:17:00,421 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 22:17:00,422 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 22:17:00,422 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 22:17:00,423 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 22:17:00,423 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 22:17:00,424 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 22:17:00,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:17:00,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 22:17:00,426 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:17:00,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:17:00,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:17:00,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:17:00,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 22:17:00,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 22:17:00,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 22:17:00,429 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:17:00,430 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:17:00,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:17:00,431 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 22:17:00,432 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:17:00,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:17:00,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:17:00,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:17:00,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:17:00,435 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 22:17:00,435 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_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f341d659968a9193c951bd8eec2bcf2a384f8494a1f57cb579da98ce5ebdb030 [2023-11-21 22:17:00,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:17:00,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:17:00,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:17:00,699 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:17:00,700 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:17:00,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/reducercommutativity/sum10-1.i [2023-11-21 22:17:03,841 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:17:04,093 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:17:04,094 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/sv-benchmarks/c/reducercommutativity/sum10-1.i [2023-11-21 22:17:04,102 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/data/c55687eb7/f55598d1e63942d3b56f2ef912b56781/FLAG22b87f47e [2023-11-21 22:17:04,115 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/data/c55687eb7/f55598d1e63942d3b56f2ef912b56781 [2023-11-21 22:17:04,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:17:04,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:17:04,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:17:04,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:17:04,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:17:04,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c5fe056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04, skipping insertion in model container [2023-11-21 22:17:04,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,153 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:17:04,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:17:04,346 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:17:04,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:17:04,386 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:17:04,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04 WrapperNode [2023-11-21 22:17:04,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:17:04,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:17:04,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:17:04,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:17:04,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,426 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2023-11-21 22:17:04,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:17:04,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:17:04,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:17:04,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:17:04,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,443 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,455 INFO L187 HeapSplitter]: Split 14 memory accesses to 2 slices as follows [2, 12] [2023-11-21 22:17:04,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:17:04,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:17:04,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:17:04,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:17:04,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04" (1/1) ... [2023-11-21 22:17:04,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:04,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:04,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:04,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 22:17:04,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:17:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:17:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:17:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:17:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:17:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 22:17:04,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:17:04,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 22:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 22:17:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:17:04,643 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:17:04,645 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:17:04,909 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:17:04,934 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:17:04,935 INFO L308 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-21 22:17:04,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:17:04 BoogieIcfgContainer [2023-11-21 22:17:04,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:17:04,938 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 22:17:04,938 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 22:17:04,942 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 22:17:04,948 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:17:04,948 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 10:17:04" (1/3) ... [2023-11-21 22:17:04,949 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61605ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:17:04, skipping insertion in model container [2023-11-21 22:17:04,950 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:17:04,950 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:17:04" (2/3) ... [2023-11-21 22:17:04,950 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61605ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:17:04, skipping insertion in model container [2023-11-21 22:17:04,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:17:04,951 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:17:04" (3/3) ... [2023-11-21 22:17:04,952 INFO L332 chiAutomizerObserver]: Analyzing ICFG sum10-1.i [2023-11-21 22:17:05,038 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 22:17:05,038 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 22:17:05,038 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 22:17:05,039 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 22:17:05,039 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 22:17:05,039 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 22:17:05,039 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 22:17:05,040 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 22:17:05,043 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-21 22:17:05,062 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-11-21 22:17:05,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:05,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:05,068 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:17:05,068 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:17:05,069 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 22:17:05,069 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-21 22:17:05,072 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-11-21 22:17:05,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:05,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:05,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-21 22:17:05,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:17:05,081 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-21 22:17:05,081 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-21 22:17:05,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:05,096 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-21 22:17:05,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:05,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455481705] [2023-11-21 22:17:05,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:05,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:05,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:05,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:05,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:05,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2023-11-21 22:17:05,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:05,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361496379] [2023-11-21 22:17:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:05,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:05,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:05,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:05,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:05,257 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2023-11-21 22:17:05,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:05,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566512098] [2023-11-21 22:17:05,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:05,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:05,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:05,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:05,613 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:17:05,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:17:05,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:17:05,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:17:05,614 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:17:05,615 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:05,615 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:17:05,615 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:17:05,615 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration1_Lasso [2023-11-21 22:17:05,615 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:17:05,616 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:17:05,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,670 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:05,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-21 22:17:06,206 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:17:06,211 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:17:06,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-21 22:17:06,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-21 22:17:06,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,352 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-21 22:17:06,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-21 22:17:06,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:17:06,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:17:06,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,448 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:17:06,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:17:06,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-21 22:17:06,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,512 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,514 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-21 22:17:06,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,529 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,529 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,568 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-21 22:17:06,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,610 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-21 22:17:06,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,667 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-21 22:17:06,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,726 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-21 22:17:06,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,782 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-21 22:17:06,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,814 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-21 22:17:06,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,847 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-21 22:17:06,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,888 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-21 22:17:06,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,901 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,917 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-21 22:17:06,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,961 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-21 22:17:06,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:06,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:06,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:06,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:06,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:06,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:06,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:06,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:06,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:06,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:06,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:06,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:06,998 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:06,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-21 22:17:07,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:07,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:07,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:07,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:07,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:07,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:07,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:07,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:07,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:07,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:07,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:07,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:07,054 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:07,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-21 22:17:07,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:07,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:07,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:07,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:07,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:07,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:17:07,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:17:07,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:07,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:07,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:07,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:07,125 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:07,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:07,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:07,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:07,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:07,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:07,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:17:07,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:17:07,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-21 22:17:07,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:07,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:07,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:07,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:07,200 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:07,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-21 22:17:07,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:07,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:07,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:07,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:07,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:07,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:17:07,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:17:07,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:07,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:07,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:07,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:07,266 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:07,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:07,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:07,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:07,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:07,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:07,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-21 22:17:07,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:17:07,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:17:07,322 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:17:07,346 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-11-21 22:17:07,347 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-11-21 22:17:07,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:07,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:07,380 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:07,384 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:17:07,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-11-21 22:17:07,415 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-21 22:17:07,416 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:17:07,416 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-21 22:17:07,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:07,457 INFO L156 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2023-11-21 22:17:07,467 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[~#x~0!base] could not be translated [2023-11-21 22:17:07,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:07,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:17:07,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:07,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 22:17:07,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:07,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:07,622 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-21 22:17:07,625 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-21 22:17:07,708 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-21 22:17:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-21 22:17:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:17:07,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2023-11-21 22:17:07,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 2 letters. Loop has 2 letters. [2023-11-21 22:17:07,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:17:07,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-21 22:17:07,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:17:07,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 2 letters. Loop has 4 letters. [2023-11-21 22:17:07,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:17:07,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 77 transitions. [2023-11-21 22:17:07,735 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-21 22:17:07,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 19 states and 27 transitions. [2023-11-21 22:17:07,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-11-21 22:17:07,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-11-21 22:17:07,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2023-11-21 22:17:07,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:07,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2023-11-21 22:17:07,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2023-11-21 22:17:07,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-21 22:17:07,772 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-21 22:17:07,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2023-11-21 22:17:07,776 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 27 transitions. [2023-11-21 22:17:07,777 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2023-11-21 22:17:07,777 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 22:17:07,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2023-11-21 22:17:07,780 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-21 22:17:07,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:07,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:07,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-21 22:17:07,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:17:07,782 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-21 22:17:07,782 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-21 22:17:07,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2023-11-21 22:17:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:07,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826296489] [2023-11-21 22:17:07,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:07,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:07,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:17:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826296489] [2023-11-21 22:17:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826296489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:17:07,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:17:07,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:17:07,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646618379] [2023-11-21 22:17:07,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:17:07,918 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:17:07,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:07,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2023-11-21 22:17:07,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:07,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094934557] [2023-11-21 22:17:07,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:07,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:07,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:07,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:08,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:17:08,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:17:08,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:17:08,018 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-21 22:17:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:17:08,038 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2023-11-21 22:17:08,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2023-11-21 22:17:08,040 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-21 22:17:08,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2023-11-21 22:17:08,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-11-21 22:17:08,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-11-21 22:17:08,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2023-11-21 22:17:08,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:08,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-11-21 22:17:08,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2023-11-21 22:17:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2023-11-21 22:17:08,051 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-21 22:17:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-11-21 22:17:08,052 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-11-21 22:17:08,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:17:08,055 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-11-21 22:17:08,055 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 22:17:08,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2023-11-21 22:17:08,056 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-21 22:17:08,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:08,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:08,057 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:17:08,057 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:17:08,058 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-21 22:17:08,058 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-21 22:17:08,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:08,058 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2023-11-21 22:17:08,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:08,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548571311] [2023-11-21 22:17:08,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:08,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:08,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:17:08,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548571311] [2023-11-21 22:17:08,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548571311] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:17:08,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596257933] [2023-11-21 22:17:08,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:08,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:17:08,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:08,154 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:17:08,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-21 22:17:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:08,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:17:08,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:08,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:17:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:08,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596257933] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:17:08,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:17:08,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-21 22:17:08,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747746575] [2023-11-21 22:17:08,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:17:08,267 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:17:08,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:08,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2023-11-21 22:17:08,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:08,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752547970] [2023-11-21 22:17:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:08,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:08,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:08,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:17:08,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:17:08,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:17:08,362 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-21 22:17:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:17:08,402 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-11-21 22:17:08,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2023-11-21 22:17:08,405 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-21 22:17:08,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 29 transitions. [2023-11-21 22:17:08,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-11-21 22:17:08,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-11-21 22:17:08,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 29 transitions. [2023-11-21 22:17:08,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:08,406 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-21 22:17:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 29 transitions. [2023-11-21 22:17:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-21 22:17:08,411 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-21 22:17:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-11-21 22:17:08,412 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-21 22:17:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:17:08,414 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-21 22:17:08,415 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 22:17:08,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2023-11-21 22:17:08,416 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-21 22:17:08,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:08,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:08,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2023-11-21 22:17:08,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:17:08,418 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-21 22:17:08,418 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-21 22:17:08,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2023-11-21 22:17:08,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958861089] [2023-11-21 22:17:08,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:08,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:08,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:17:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958861089] [2023-11-21 22:17:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958861089] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:17:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94522937] [2023-11-21 22:17:08,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:17:08,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:17:08,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:08,607 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:17:08,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-21 22:17:08,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:17:08,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:17:08,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 22:17:08,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:08,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:17:08,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:08,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94522937] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:17:08,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:17:08,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-21 22:17:08,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7737053] [2023-11-21 22:17:08,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:17:08,806 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:17:08,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2023-11-21 22:17:08,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:08,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633632171] [2023-11-21 22:17:08,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:08,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:08,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:08,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:17:08,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-21 22:17:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-21 22:17:08,888 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-21 22:17:08,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:17:08,947 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2023-11-21 22:17:08,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2023-11-21 22:17:08,954 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-21 22:17:08,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2023-11-21 22:17:08,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-11-21 22:17:08,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-11-21 22:17:08,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2023-11-21 22:17:08,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:08,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-11-21 22:17:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2023-11-21 22:17:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-21 22:17:08,961 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-21 22:17:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-11-21 22:17:08,962 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-11-21 22:17:08,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 22:17:08,965 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-11-21 22:17:08,965 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-21 22:17:08,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2023-11-21 22:17:08,968 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-11-21 22:17:08,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:08,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:08,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2023-11-21 22:17:08,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:17:08,971 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-21 22:17:08,971 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-21 22:17:08,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 3 times [2023-11-21 22:17:08,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:08,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962842873] [2023-11-21 22:17:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:08,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:09,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:09,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:09,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:09,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2023-11-21 22:17:09,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:09,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822932921] [2023-11-21 22:17:09,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:09,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:09,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:09,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:09,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:09,089 INFO L85 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2023-11-21 22:17:09,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:09,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934701266] [2023-11-21 22:17:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:09,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:09,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:09,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:14,304 WARN L293 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 211 DAG size of output: 165 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-21 22:17:14,570 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:17:14,570 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:17:14,570 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:17:14,571 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:17:14,571 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:17:14,571 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:14,571 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:17:14,571 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:17:14,571 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration5_Lasso [2023-11-21 22:17:14,571 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:17:14,571 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:17:14,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:14,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,094 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:15,476 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 22:17:15,476 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 22:17:15,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:15,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:15,481 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:15,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:15,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:15,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 22:17:15,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:15,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:15,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:15,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 22:17:15,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 22:17:15,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-21 22:17:15,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 22:17:15,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:15,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:15,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:15,547 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:15,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 22:17:15,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 22:17:15,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 22:17:15,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 22:17:15,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 22:17:15,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-21 22:17:15,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 22:17:15,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 22:17:15,617 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 22:17:15,638 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-11-21 22:17:15,639 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2023-11-21 22:17:15,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:15,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:15,641 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:17:15,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-21 22:17:15,642 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 22:17:15,653 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-21 22:17:15,654 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 22:17:15,654 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-21 22:17:15,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-11-21 22:17:15,700 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2023-11-21 22:17:15,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:15,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 22:17:15,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:15,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:17:15,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:17:15,810 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-11-21 22:17:15,810 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-21 22:17:15,834 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-21 22:17:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-11-21 22:17:15,837 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-21 22:17:15,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2023-11-21 22:17:15,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 2 letters. [2023-11-21 22:17:15,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:17:15,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 26 letters. Loop has 2 letters. [2023-11-21 22:17:15,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:17:15,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 4 letters. [2023-11-21 22:17:15,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 22:17:15,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2023-11-21 22:17:15,842 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-21 22:17:15,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 43 transitions. [2023-11-21 22:17:15,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2023-11-21 22:17:15,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-11-21 22:17:15,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2023-11-21 22:17:15,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:15,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-11-21 22:17:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2023-11-21 22:17:15,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-21 22:17:15,855 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-21 22:17:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-11-21 22:17:15,857 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-11-21 22:17:15,857 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-11-21 22:17:15,857 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-21 22:17:15,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2023-11-21 22:17:15,859 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-21 22:17:15,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:15,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:15,860 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:17:15,860 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:17:15,861 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-21 22:17:15,861 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-21 22:17:15,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:15,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2023-11-21 22:17:15,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:15,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138573994] [2023-11-21 22:17:15,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:15,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:15,995 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-21 22:17:15,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:17:15,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138573994] [2023-11-21 22:17:15,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138573994] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:17:15,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:17:15,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:17:15,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755389298] [2023-11-21 22:17:15,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:17:15,996 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:17:15,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:15,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2023-11-21 22:17:15,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:15,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286828487] [2023-11-21 22:17:15,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:15,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:16,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:16,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:16,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:17:16,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:17:16,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:17:16,049 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-21 22:17:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:17:16,077 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2023-11-21 22:17:16,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2023-11-21 22:17:16,080 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-21 22:17:16,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2023-11-21 22:17:16,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-11-21 22:17:16,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-11-21 22:17:16,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2023-11-21 22:17:16,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:16,081 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-11-21 22:17:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2023-11-21 22:17:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2023-11-21 22:17:16,085 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-21 22:17:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-11-21 22:17:16,088 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-11-21 22:17:16,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:17:16,091 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-11-21 22:17:16,091 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-21 22:17:16,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2023-11-21 22:17:16,091 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-21 22:17:16,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:16,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:16,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:17:16,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:17:16,094 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-21 22:17:16,094 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-21 22:17:16,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:16,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2023-11-21 22:17:16,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:16,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903983637] [2023-11-21 22:17:16,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:16,209 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-21 22:17:16,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:17:16,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903983637] [2023-11-21 22:17:16,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903983637] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:17:16,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919640129] [2023-11-21 22:17:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:16,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:17:16,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:16,212 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:17:16,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-21 22:17:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:16,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:17:16,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:16,330 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-21 22:17:16,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:17:16,351 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-21 22:17:16,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919640129] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:17:16,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:17:16,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-21 22:17:16,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340681794] [2023-11-21 22:17:16,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:17:16,352 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:17:16,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:16,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2023-11-21 22:17:16,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:16,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015997549] [2023-11-21 22:17:16,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:16,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:16,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:16,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:16,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:17:16,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 22:17:16,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:17:16,442 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-21 22:17:16,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-11-21 22:17:16,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:17:16,525 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2023-11-21 22:17:16,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 62 transitions. [2023-11-21 22:17:16,526 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-21 22:17:16,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 62 transitions. [2023-11-21 22:17:16,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-11-21 22:17:16,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-11-21 22:17:16,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 62 transitions. [2023-11-21 22:17:16,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:16,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 62 transitions. [2023-11-21 22:17:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 62 transitions. [2023-11-21 22:17:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2023-11-21 22:17:16,531 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-21 22:17:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2023-11-21 22:17:16,532 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 55 transitions. [2023-11-21 22:17:16,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:17:16,533 INFO L428 stractBuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2023-11-21 22:17:16,533 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-21 22:17:16,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2023-11-21 22:17:16,534 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-21 22:17:16,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:16,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:16,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:17:16,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:17:16,536 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-21 22:17:16,536 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-21 22:17:16,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:16,537 INFO L85 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 1 times [2023-11-21 22:17:16,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:16,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421376134] [2023-11-21 22:17:16,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:16,720 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-21 22:17:16,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:17:16,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421376134] [2023-11-21 22:17:16,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421376134] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:17:16,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445158929] [2023-11-21 22:17:16,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:16,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:17:16,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:16,722 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:17:16,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-21 22:17:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:16,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 22:17:16,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:16,873 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-21 22:17:16,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:17:16,937 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-21 22:17:16,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445158929] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:17:16,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:17:16,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-21 22:17:16,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148018257] [2023-11-21 22:17:16,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:17:16,940 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 22:17:16,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:16,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2023-11-21 22:17:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:16,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927260825] [2023-11-21 22:17:16,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:16,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:16,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:16,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:16,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:17:16,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-21 22:17:16,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-21 22:17:16,996 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-21 22:17:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:17:17,172 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2023-11-21 22:17:17,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2023-11-21 22:17:17,173 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-21 22:17:17,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2023-11-21 22:17:17,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2023-11-21 22:17:17,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2023-11-21 22:17:17,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2023-11-21 22:17:17,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:17,181 INFO L218 hiAutomatonCegarLoop]: Abstraction has 94 states and 98 transitions. [2023-11-21 22:17:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2023-11-21 22:17:17,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2023-11-21 22:17:17,190 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-21 22:17:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2023-11-21 22:17:17,190 INFO L240 hiAutomatonCegarLoop]: Abstraction has 75 states and 79 transitions. [2023-11-21 22:17:17,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-21 22:17:17,193 INFO L428 stractBuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2023-11-21 22:17:17,194 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-21 22:17:17,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2023-11-21 22:17:17,194 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-11-21 22:17:17,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:17,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:17,198 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:17:17,198 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:17:17,199 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-21 22:17:17,201 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-21 22:17:17,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:17,202 INFO L85 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 2 times [2023-11-21 22:17:17,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:17,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232312087] [2023-11-21 22:17:17,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:17,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:17,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:17,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:17,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:17,582 INFO L85 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2023-11-21 22:17:17,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:17,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909823426] [2023-11-21 22:17:17,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:17,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:17,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:17,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:17,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 3 times [2023-11-21 22:17:17,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:17,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644833705] [2023-11-21 22:17:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:17,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:17:18,057 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-21 22:17:18,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:17:18,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644833705] [2023-11-21 22:17:18,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644833705] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:17:18,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795750387] [2023-11-21 22:17:18,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:17:18,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:17:18,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:17:18,060 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:17:18,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57172835-4a0d-44e8-8843-d96da5d425f2/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-11-21 22:17:18,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-11-21 22:17:18,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:17:18,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 22:17:18,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:17:18,410 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-21 22:17:18,411 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:17:18,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795750387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:17:18,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:17:18,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 13 [2023-11-21 22:17:18,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253811512] [2023-11-21 22:17:18,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:17:18,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:17:18,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-21 22:17:18,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2023-11-21 22:17:18,457 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-21 22:17:18,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:17:18,689 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2023-11-21 22:17:18,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2023-11-21 22:17:18,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-21 22:17:18,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2023-11-21 22:17:18,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2023-11-21 22:17:18,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2023-11-21 22:17:18,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2023-11-21 22:17:18,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:17:18,692 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2023-11-21 22:17:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2023-11-21 22:17:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-11-21 22:17:18,695 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-21 22:17:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2023-11-21 22:17:18,696 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 73 transitions. [2023-11-21 22:17:18,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-21 22:17:18,697 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2023-11-21 22:17:18,697 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-21 22:17:18,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2023-11-21 22:17:18,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2023-11-21 22:17:18,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:17:18,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:17:18,699 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:17:18,699 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 22:17:18,699 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-21 22:17:18,700 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-21 22:17:18,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2023-11-21 22:17:18,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:18,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526563520] [2023-11-21 22:17:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:18,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:18,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:18,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:18,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:18,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2023-11-21 22:17:18,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:18,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760365304] [2023-11-21 22:17:18,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:18,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:18,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:18,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:18,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:17:18,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1072398385, now seen corresponding path program 1 times [2023-11-21 22:17:18,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:17:18,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393271332] [2023-11-21 22:17:18,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:17:18,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:17:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:19,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:17:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:17:19,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:17:44,254 WARN L293 SmtUtils]: Spent 24.99s 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-21 22:17:45,887 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 22:17:45,887 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 22:17:45,888 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 22:17:45,888 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 22:17:45,888 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 22:17:45,888 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:17:45,888 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 22:17:45,888 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 22:17:45,888 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum10-1.i_Iteration10_Lasso [2023-11-21 22:17:45,888 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 22:17:45,888 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 22:17:45,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:45,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 22:17:45,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true