./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/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_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/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 64bit --witnessprinter.graph.data.programhash 4073cc5fe0afdc3910807054eaaf7f0047f472ba2d7a571a291a999e2fa35b78 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 20:57:17,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 20:57:17,280 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-11-21 20:57:17,289 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 20:57:17,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 20:57:17,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 20:57:17,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 20:57:17,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 20:57:17,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 20:57:17,343 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 20:57:17,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 20:57:17,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 20:57:17,345 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 20:57:17,348 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 20:57:17,348 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 20:57:17,349 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 20:57:17,350 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 20:57:17,350 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 20:57:17,351 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 20:57:17,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 20:57:17,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 20:57:17,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 20:57:17,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 20:57:17,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 20:57:17,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 20:57:17,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 20:57:17,355 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 20:57:17,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 20:57:17,356 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 20:57:17,357 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 20:57:17,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 20:57:17,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 20:57:17,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 20:57:17,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 20:57:17,360 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 20:57:17,360 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_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/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_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4073cc5fe0afdc3910807054eaaf7f0047f472ba2d7a571a291a999e2fa35b78 [2023-11-21 20:57:17,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 20:57:17,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 20:57:17,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 20:57:17,779 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 20:57:17,779 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 20:57:17,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2023-11-21 20:57:21,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 20:57:21,945 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 20:57:21,946 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/sv-benchmarks/c/termination-memory-alloca/lis-alloca-2.i [2023-11-21 20:57:21,963 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/data/6f68bde3f/afd26fe3d4f44ef38611a679fdf52747/FLAG3c30a1678 [2023-11-21 20:57:21,994 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/data/6f68bde3f/afd26fe3d4f44ef38611a679fdf52747 [2023-11-21 20:57:21,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 20:57:21,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 20:57:22,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 20:57:22,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 20:57:22,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 20:57:22,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:57:21" (1/1) ... [2023-11-21 20:57:22,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ed2412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22, skipping insertion in model container [2023-11-21 20:57:22,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:57:21" (1/1) ... [2023-11-21 20:57:22,071 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 20:57:22,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:57:22,497 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 20:57:22,550 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:57:22,588 INFO L206 MainTranslator]: Completed translation [2023-11-21 20:57:22,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22 WrapperNode [2023-11-21 20:57:22,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 20:57:22,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 20:57:22,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 20:57:22,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 20:57:22,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22" (1/1) ... [2023-11-21 20:57:22,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22" (1/1) ... [2023-11-21 20:57:22,658 INFO L138 Inliner]: procedures = 111, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2023-11-21 20:57:22,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 20:57:22,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 20:57:22,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 20:57:22,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 20:57:22,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22" (1/1) ... [2023-11-21 20:57:22,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22" (1/1) ... [2023-11-21 20:57:22,697 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22" (1/1) ... [2023-11-21 20:57:22,713 INFO L187 HeapSplitter]: Split 11 memory accesses to 3 slices as follows [2, 7, 2] [2023-11-21 20:57:22,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22" (1/1) ... [2023-11-21 20:57:22,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22" (1/1) ... [2023-11-21 20:57:22,723 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22" (1/1) ... [2023-11-21 20:57:22,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22" (1/1) ... [2023-11-21 20:57:22,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22" (1/1) ... [2023-11-21 20:57:22,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22" (1/1) ... [2023-11-21 20:57:22,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 20:57:22,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 20:57:22,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 20:57:22,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 20:57:22,739 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22" (1/1) ... [2023-11-21 20:57:22,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:22,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:22,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:22,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 20:57:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 20:57:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 20:57:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 20:57:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 20:57:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 20:57:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 20:57:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 20:57:22,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 20:57:22,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 20:57:22,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 20:57:23,022 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 20:57:23,026 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 20:57:23,338 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 20:57:23,348 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 20:57:23,348 INFO L308 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-21 20:57:23,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:57:23 BoogieIcfgContainer [2023-11-21 20:57:23,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 20:57:23,351 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 20:57:23,351 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 20:57:23,356 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 20:57:23,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 20:57:23,357 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 08:57:21" (1/3) ... [2023-11-21 20:57:23,358 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12a170f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 08:57:23, skipping insertion in model container [2023-11-21 20:57:23,359 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 20:57:23,359 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:57:22" (2/3) ... [2023-11-21 20:57:23,359 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12a170f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 08:57:23, skipping insertion in model container [2023-11-21 20:57:23,359 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 20:57:23,360 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:57:23" (3/3) ... [2023-11-21 20:57:23,361 INFO L332 chiAutomizerObserver]: Analyzing ICFG lis-alloca-2.i [2023-11-21 20:57:23,413 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 20:57:23,413 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 20:57:23,414 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 20:57:23,414 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 20:57:23,414 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 20:57:23,414 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 20:57:23,414 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 20:57:23,415 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 20:57:23,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 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 20:57:23,440 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-21 20:57:23,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 20:57:23,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 20:57:23,446 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-21 20:57:23,446 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 20:57:23,447 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 20:57:23,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 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 20:57:23,449 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2023-11-21 20:57:23,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 20:57:23,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 20:57:23,450 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-11-21 20:57:23,450 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-11-21 20:57:23,458 INFO L748 eck$LassoCheckResult]: Stem: 20#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3#L565true assume !(main_~array_size~0#1 < 1); 18#L565-2true call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 4#L552-3true [2023-11-21 20:57:23,459 INFO L750 eck$LassoCheckResult]: Loop: 4#L552-3true assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 15#L552-2true lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 4#L552-3true [2023-11-21 20:57:23,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:23,465 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2023-11-21 20:57:23,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:23,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188604046] [2023-11-21 20:57:23,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:23,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:23,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:23,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:23,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:23,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2023-11-21 20:57:23,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:23,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847088390] [2023-11-21 20:57:23,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:23,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:23,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:23,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:23,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:23,760 INFO L85 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2023-11-21 20:57:23,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:23,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571938167] [2023-11-21 20:57:23,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:23,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:23,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:23,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:25,078 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 20:57:25,078 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 20:57:25,079 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 20:57:25,079 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 20:57:25,079 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 20:57:25,080 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:25,080 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 20:57:25,080 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 20:57:25,080 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration1_Lasso [2023-11-21 20:57:25,081 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 20:57:25,081 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 20:57:25,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 20:57:25,127 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 20:57:25,132 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 20:57:25,136 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 20:57:25,142 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 20:57:25,147 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 20:57:25,151 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 20:57:25,155 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 20:57:25,161 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 20:57:25,164 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 20:57:25,170 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 20:57:25,175 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 20:57:25,179 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 20:57:25,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 20:57:25,947 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 20:57:25,951 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 20:57:25,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:25,969 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 20:57:25,974 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 20:57:25,977 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 20:57:25,981 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 20:57:25,984 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 20:57:25,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:25,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:25,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:25,998 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 20:57:26,002 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 20:57:26,006 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 20:57:26,855 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 20:57:26,861 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 20:57:26,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:26,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:26,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:26,874 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 20:57:26,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-11-21 20:57:26,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:26,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:26,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:26,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:26,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:26,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:26,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:26,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:26,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-11-21 20:57:26,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:26,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:26,936 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:26,947 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 20:57:26,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-11-21 20:57:26,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:26,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:26,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:26,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:26,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:26,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:26,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:26,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:27,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:27,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:27,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:27,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:27,022 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 20:57:27,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-11-21 20:57:27,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:27,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:27,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:27,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:27,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:27,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:27,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:27,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:27,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-11-21 20:57:27,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:27,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:27,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:27,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-11-21 20:57:27,087 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 20:57:27,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:27,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:27,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:27,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:27,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:27,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:27,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:27,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:27,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:27,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:27,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:27,144 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:27,155 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 20:57:27,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-11-21 20:57:27,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:27,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:27,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:27,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:27,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:27,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:27,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:27,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:27,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:27,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:27,219 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:27,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 20:57:27,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:27,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:27,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:27,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:27,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:27,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:27,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-11-21 20:57:27,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:27,281 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:27,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:27,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:27,283 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:27,290 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 20:57:27,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-11-21 20:57:27,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:27,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:27,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:27,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:27,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:27,307 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:27,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:27,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:27,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:27,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:27,346 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:27,354 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 20:57:27,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-11-21 20:57:27,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:27,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:27,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:27,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:27,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:27,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:27,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:27,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:27,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:27,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:27,423 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:27,426 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 20:57:27,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-11-21 20:57:27,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:27,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:27,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:27,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:27,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:27,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:27,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:27,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:27,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:27,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:27,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:27,483 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:27,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-11-21 20:57:27,487 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 20:57:27,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:27,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:27,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:27,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:27,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:27,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:27,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:27,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:27,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:27,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:27,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:27,515 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:27,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-11-21 20:57:27,520 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 20:57:27,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:27,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:27,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:27,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:27,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:27,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:27,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:27,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:27,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:27,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:27,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:27,548 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:27,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-11-21 20:57:27,551 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 20:57:27,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:27,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:27,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:27,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:27,568 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:27,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:27,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:27,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:27,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:27,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:27,613 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:27,626 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 20:57:27,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:27,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:27,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:27,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:27,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-11-21 20:57:27,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:27,654 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:27,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:27,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:27,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:27,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:27,701 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:27,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-11-21 20:57:27,705 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 20:57:27,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:27,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:27,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:27,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:27,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:27,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:27,773 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 20:57:27,870 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2023-11-21 20:57:27,871 INFO L444 ModelExtractionUtils]: 14 out of 37 variables were initially zero. Simplification set additionally 20 variables to zero. [2023-11-21 20:57:27,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:27,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:27,914 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:27,924 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 20:57:27,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-11-21 20:57:27,950 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-21 20:57:27,950 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 20:57:27,951 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~N#1, ULTIMATE.start_lis_~i~0#1) = 1*ULTIMATE.start_lis_~N#1 - 1*ULTIMATE.start_lis_~i~0#1 Supporting invariants [] [2023-11-21 20:57:27,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:28,072 INFO L156 tatePredicateManager]: 15 out of 15 supporting invariants were superfluous and have been removed [2023-11-21 20:57:28,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:28,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 20:57:28,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:28,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 20:57:28,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:28,214 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 20:57:28,272 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 20:57:28,275 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 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 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:28,357 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 21 states have internal predecessors, (33), 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 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 64 transitions. Complement of second has 8 states. [2023-11-21 20:57:28,359 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 20:57:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2023-11-21 20:57:28,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2023-11-21 20:57:28,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:28,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 6 letters. Loop has 2 letters. [2023-11-21 20:57:28,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:28,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 4 letters. [2023-11-21 20:57:28,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:28,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 64 transitions. [2023-11-21 20:57:28,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-21 20:57:28,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 18 states and 28 transitions. [2023-11-21 20:57:28,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2023-11-21 20:57:28,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2023-11-21 20:57:28,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 28 transitions. [2023-11-21 20:57:28,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:57:28,395 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2023-11-21 20:57:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 28 transitions. [2023-11-21 20:57:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-21 20:57:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 states have internal predecessors, (28), 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 20:57:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2023-11-21 20:57:28,431 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2023-11-21 20:57:28,431 INFO L428 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2023-11-21 20:57:28,431 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 20:57:28,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2023-11-21 20:57:28,433 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2023-11-21 20:57:28,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 20:57:28,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 20:57:28,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-11-21 20:57:28,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-11-21 20:57:28,434 INFO L748 eck$LassoCheckResult]: Stem: 185#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 184#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 168#L565 assume !(main_~array_size~0#1 < 1); 169#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 170#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 172#L552-4 lis_~i~0#1 := 1; 174#L554-3 [2023-11-21 20:57:28,434 INFO L750 eck$LassoCheckResult]: Loop: 174#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 175#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 176#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 174#L554-3 [2023-11-21 20:57:28,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2023-11-21 20:57:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:28,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859421016] [2023-11-21 20:57:28,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:28,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:28,737 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 20:57:28,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:28,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859421016] [2023-11-21 20:57:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859421016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:28,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:28,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 20:57:28,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972794920] [2023-11-21 20:57:28,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:28,747 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 20:57:28,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:28,748 INFO L85 PathProgramCache]: Analyzing trace with hash 60785, now seen corresponding path program 1 times [2023-11-21 20:57:28,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:28,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152142882] [2023-11-21 20:57:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:28,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:28,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:28,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:28,819 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 20:57:28,819 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 20:57:28,820 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 20:57:28,820 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 20:57:28,820 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-11-21 20:57:28,820 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:28,820 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 20:57:28,821 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 20:57:28,821 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2023-11-21 20:57:28,821 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 20:57:28,821 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 20:57:28,823 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 20:57:28,826 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 20:57:28,836 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 20:57:28,841 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 20:57:28,846 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 20:57:28,851 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 20:57:28,941 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 20:57:28,942 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-11-21 20:57:28,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:28,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:28,947 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:28,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 20:57:28,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 20:57:28,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-11-21 20:57:28,977 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-11-21 20:57:28,977 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_lis_#t~post5#1=0} Honda state: {ULTIMATE.start_lis_#t~post5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-11-21 20:57:29,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:29,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:29,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:29,007 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:29,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-11-21 20:57:29,013 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 20:57:29,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-11-21 20:57:29,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:29,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:29,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:29,063 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:29,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-11-21 20:57:29,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-11-21 20:57:29,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-11-21 20:57:29,123 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-11-21 20:57:29,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:29,132 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 20:57:29,132 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 20:57:29,133 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 20:57:29,133 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 20:57:29,133 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 20:57:29,133 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:29,133 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 20:57:29,133 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 20:57:29,133 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration2_Loop [2023-11-21 20:57:29,133 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 20:57:29,133 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 20:57:29,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 20:57:29,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 20:57:29,149 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 20:57:29,152 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 20:57:29,156 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 20:57:29,159 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 20:57:29,230 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 20:57:29,230 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 20:57:29,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:29,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:29,232 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:29,246 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 20:57:29,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-11-21 20:57:29,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:29,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:29,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:29,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:29,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:29,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:29,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:29,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:29,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:29,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:29,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:29,301 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:29,310 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 20:57:29,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-11-21 20:57:29,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:29,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:29,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:29,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:29,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:29,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:29,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:29,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 20:57:29,355 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-11-21 20:57:29,355 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-11-21 20:57:29,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:29,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:29,361 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:29,369 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 20:57:29,369 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-11-21 20:57:29,369 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 20:57:29,369 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~i~0#1) = -2*ULTIMATE.start_lis_~i~0#1 + 1 Supporting invariants [] [2023-11-21 20:57:29,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-11-21 20:57:29,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:29,399 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-11-21 20:57:29,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:29,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-21 20:57:29,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:29,473 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 20:57:29,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:29,526 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 20:57:29,527 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-11-21 20:57:29,527 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 20:57:29,651 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) Result 49 states and 84 transitions. Complement of second has 10 states. [2023-11-21 20:57:29,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-11-21 20:57:29,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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 20:57:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2023-11-21 20:57:29,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 3 letters. [2023-11-21 20:57:29,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:29,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 9 letters. Loop has 3 letters. [2023-11-21 20:57:29,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:29,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 50 transitions. Stem has 6 letters. Loop has 6 letters. [2023-11-21 20:57:29,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:29,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 84 transitions. [2023-11-21 20:57:29,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2023-11-21 20:57:29,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 37 states and 57 transitions. [2023-11-21 20:57:29,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-11-21 20:57:29,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-11-21 20:57:29,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 57 transitions. [2023-11-21 20:57:29,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 20:57:29,674 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 57 transitions. [2023-11-21 20:57:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 57 transitions. [2023-11-21 20:57:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2023-11-21 20:57:29,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2023-11-21 20:57:29,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 45 transitions. [2023-11-21 20:57:29,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:29,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 20:57:29,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 20:57:29,686 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:29,767 INFO L93 Difference]: Finished difference Result 30 states and 45 transitions. [2023-11-21 20:57:29,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 45 transitions. [2023-11-21 20:57:29,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 20:57:29,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 45 transitions. [2023-11-21 20:57:29,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2023-11-21 20:57:29,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-11-21 20:57:29,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2023-11-21 20:57:29,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 20:57:29,770 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 45 transitions. [2023-11-21 20:57:29,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2023-11-21 20:57:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2023-11-21 20:57:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 28 states have internal predecessors, (44), 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 20:57:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2023-11-21 20:57:29,774 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 44 transitions. [2023-11-21 20:57:29,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 20:57:29,780 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 44 transitions. [2023-11-21 20:57:29,780 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 20:57:29,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 44 transitions. [2023-11-21 20:57:29,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 20:57:29,782 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 20:57:29,782 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 20:57:29,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:29,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:29,784 INFO L748 eck$LassoCheckResult]: Stem: 379#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 373#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 352#L565 assume !(main_~array_size~0#1 < 1); 353#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 354#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 355#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 356#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 357#L552-4 lis_~i~0#1 := 1; 358#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 359#L555-3 [2023-11-21 20:57:29,784 INFO L750 eck$LassoCheckResult]: Loop: 359#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 360#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 366#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 368#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 370#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 375#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 376#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 359#L555-3 [2023-11-21 20:57:29,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:29,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2023-11-21 20:57:29,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:29,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656921800] [2023-11-21 20:57:29,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:29,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:29,997 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 20:57:29,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:29,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656921800] [2023-11-21 20:57:29,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656921800] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:29,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068218350] [2023-11-21 20:57:29,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:29,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:29,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:30,000 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:30,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-21 20:57:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:30,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 20:57:30,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:30,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:30,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:30,218 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 20:57:30,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:30,272 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 20:57:30,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068218350] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:30,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:30,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-21 20:57:30,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628305762] [2023-11-21 20:57:30,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:30,274 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 20:57:30,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:30,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 1 times [2023-11-21 20:57:30,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:30,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448214988] [2023-11-21 20:57:30,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:30,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:30,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:30,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:30,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:30,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-21 20:57:30,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-21 20:57:30,845 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. cyclomatic complexity: 19 Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 20:57:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:31,004 INFO L93 Difference]: Finished difference Result 59 states and 84 transitions. [2023-11-21 20:57:31,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 84 transitions. [2023-11-21 20:57:31,006 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2023-11-21 20:57:31,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 74 transitions. [2023-11-21 20:57:31,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-11-21 20:57:31,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-11-21 20:57:31,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 74 transitions. [2023-11-21 20:57:31,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 20:57:31,009 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 74 transitions. [2023-11-21 20:57:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 74 transitions. [2023-11-21 20:57:31,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2023-11-21 20:57:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2023-11-21 20:57:31,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2023-11-21 20:57:31,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 20:57:31,018 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2023-11-21 20:57:31,018 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 20:57:31,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2023-11-21 20:57:31,019 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 20:57:31,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 20:57:31,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 20:57:31,020 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:31,021 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:31,021 INFO L748 eck$LassoCheckResult]: Stem: 532#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 526#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 504#L565 assume !(main_~array_size~0#1 < 1); 505#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 506#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 507#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 508#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 509#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 533#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 510#L552-4 lis_~i~0#1 := 1; 511#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 512#L555-3 [2023-11-21 20:57:31,021 INFO L750 eck$LassoCheckResult]: Loop: 512#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 513#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 517#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 521#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 523#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 528#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 529#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 512#L555-3 [2023-11-21 20:57:31,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2023-11-21 20:57:31,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:31,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365649470] [2023-11-21 20:57:31,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:31,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:31,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:31,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:31,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:31,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 2 times [2023-11-21 20:57:31,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:31,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510090862] [2023-11-21 20:57:31,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:31,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:31,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:31,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:31,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1776402153, now seen corresponding path program 1 times [2023-11-21 20:57:31,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:31,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543187277] [2023-11-21 20:57:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:31,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 20:57:31,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:31,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543187277] [2023-11-21 20:57:31,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543187277] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:31,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671851661] [2023-11-21 20:57:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:31,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:31,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:31,351 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:31,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-21 20:57:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:31,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-21 20:57:31,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 20:57:31,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 20:57:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671851661] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:31,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:31,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-21 20:57:31,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637559673] [2023-11-21 20:57:31,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:32,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-21 20:57:32,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-21 20:57:32,152 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. cyclomatic complexity: 18 Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 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 20:57:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:32,386 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2023-11-21 20:57:32,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 142 transitions. [2023-11-21 20:57:32,388 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2023-11-21 20:57:32,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 79 states and 114 transitions. [2023-11-21 20:57:32,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2023-11-21 20:57:32,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2023-11-21 20:57:32,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 114 transitions. [2023-11-21 20:57:32,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 20:57:32,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 114 transitions. [2023-11-21 20:57:32,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 114 transitions. [2023-11-21 20:57:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2023-11-21 20:57:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 48 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2023-11-21 20:57:32,397 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 71 transitions. [2023-11-21 20:57:32,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 20:57:32,402 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 71 transitions. [2023-11-21 20:57:32,404 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-21 20:57:32,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 71 transitions. [2023-11-21 20:57:32,405 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 20:57:32,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 20:57:32,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 20:57:32,406 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:32,407 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-21 20:57:32,408 INFO L748 eck$LassoCheckResult]: Stem: 784#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 779#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 759#L565 assume !(main_~array_size~0#1 < 1); 760#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 761#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 762#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 763#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 764#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 803#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 765#L552-4 lis_~i~0#1 := 1; 766#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 767#L555-3 [2023-11-21 20:57:32,408 INFO L750 eck$LassoCheckResult]: Loop: 767#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 768#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 772#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 776#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 767#L555-3 [2023-11-21 20:57:32,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:32,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 3 times [2023-11-21 20:57:32,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:32,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430607256] [2023-11-21 20:57:32,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:32,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:32,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:32,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:32,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:32,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 1 times [2023-11-21 20:57:32,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:32,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007596307] [2023-11-21 20:57:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:32,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:32,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:32,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:32,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1166707861, now seen corresponding path program 1 times [2023-11-21 20:57:32,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:32,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913899020] [2023-11-21 20:57:32,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:32,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:32,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:32,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:34,214 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 20:57:34,214 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 20:57:34,214 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 20:57:34,214 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 20:57:34,214 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 20:57:34,215 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:34,215 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 20:57:34,215 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 20:57:34,215 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration5_Lasso [2023-11-21 20:57:34,215 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 20:57:34,215 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 20:57:34,221 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 20:57:34,228 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 20:57:34,230 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 20:57:34,233 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 20:57:34,235 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 20:57:34,238 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 20:57:34,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:34,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:34,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:34,250 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 20:57:34,253 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 20:57:35,675 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 20:57:35,679 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 20:57:35,682 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 20:57:35,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 20:57:35,689 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 20:57:35,692 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 20:57:35,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 20:57:35,698 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 20:57:35,702 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 20:57:35,705 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 20:57:35,709 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 20:57:35,712 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 20:57:35,714 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 20:57:35,722 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 20:57:35,726 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 20:57:36,754 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 20:57:36,755 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 20:57:36,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:36,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:36,760 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:36,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-11-21 20:57:36,765 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 20:57:36,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:36,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:36,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:36,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:36,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:36,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:36,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:36,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:36,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-11-21 20:57:36,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:36,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:36,796 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:36,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-11-21 20:57:36,799 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 20:57:36,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:36,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:36,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:36,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:36,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:36,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:36,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:36,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:36,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:36,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:36,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:36,835 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:36,842 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 20:57:36,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-11-21 20:57:36,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:36,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:36,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:36,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:36,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:36,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:36,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:36,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:36,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:36,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:36,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:36,878 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:36,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-11-21 20:57:36,881 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 20:57:36,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:36,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:36,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:36,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:36,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:36,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:36,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:36,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:36,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:36,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:36,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:36,940 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:36,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-11-21 20:57:36,943 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 20:57:36,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:36,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:36,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:36,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:36,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:36,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:36,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:36,973 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:36,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:36,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:36,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:36,993 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:36,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-11-21 20:57:36,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 20:57:37,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:37,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:37,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:37,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:37,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:37,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:37,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:37,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-11-21 20:57:37,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:37,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:37,034 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:37,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-11-21 20:57:37,047 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 20:57:37,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:37,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:37,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:37,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:37,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:37,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:37,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:37,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:37,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:37,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:37,116 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:37,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-11-21 20:57:37,178 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 20:57:37,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:37,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:37,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:37,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:37,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:37,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:37,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:37,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:37,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-11-21 20:57:37,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:37,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:37,224 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:37,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-11-21 20:57:37,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-11-21 20:57:37,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:37,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:37,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:37,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:37,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:37,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:37,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:37,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2023-11-21 20:57:37,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:37,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:37,264 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:37,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-11-21 20:57:37,266 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 20:57:37,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:37,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:37,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:37,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:37,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:37,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:37,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:37,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:37,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-11-21 20:57:37,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:37,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:37,298 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:37,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-11-21 20:57:37,300 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 20:57:37,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:37,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:37,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:37,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:37,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:37,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:37,353 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 20:57:37,378 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-11-21 20:57:37,378 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-11-21 20:57:37,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:37,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:37,385 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:37,388 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 20:57:37,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-11-21 20:57:37,419 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-21 20:57:37,419 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 20:57:37,419 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_lis_~best~0#1.base) (+ ULTIMATE.start_lis_~best~0#1.offset (* ULTIMATE.start_lis_~j~0#1 4)))_1, v_rep(select (select #memory_int#1 ULTIMATE.start_lis_~best~0#1.base) 0)_1) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_lis_~best~0#1.base) (+ ULTIMATE.start_lis_~best~0#1.offset (* ULTIMATE.start_lis_~j~0#1 4)))_1 + 2*v_rep(select (select #memory_int#1 ULTIMATE.start_lis_~best~0#1.base) 0)_1 + 1 Supporting invariants [] [2023-11-21 20:57:37,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:37,663 INFO L156 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2023-11-21 20:57:37,668 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~best~0!base][0] could not be translated [2023-11-21 20:57:37,669 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~best~0!base][~best~0!offset + ~j~0 * 4] could not be translated [2023-11-21 20:57:37,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:37,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 20:57:37,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:37,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-21 20:57:37,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:38,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:57:38,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:57:38,021 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 20:57:38,027 INFO L349 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2023-11-21 20:57:38,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 43 [2023-11-21 20:57:38,087 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 20:57:38,087 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2023-11-21 20:57:38,088 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 71 transitions. cyclomatic complexity: 28 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 20:57:38,257 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 71 transitions. cyclomatic complexity: 28. 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) Result 94 states and 133 transitions. Complement of second has 13 states. [2023-11-21 20:57:38,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2023-11-21 20:57:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. 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 20:57:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2023-11-21 20:57:38,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2023-11-21 20:57:38,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:38,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 15 letters. Loop has 4 letters. [2023-11-21 20:57:38,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:38,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 19 transitions. Stem has 11 letters. Loop has 8 letters. [2023-11-21 20:57:38,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:38,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 133 transitions. [2023-11-21 20:57:38,265 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 20:57:38,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 82 states and 118 transitions. [2023-11-21 20:57:38,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2023-11-21 20:57:38,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2023-11-21 20:57:38,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 118 transitions. [2023-11-21 20:57:38,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 20:57:38,269 INFO L218 hiAutomatonCegarLoop]: Abstraction has 82 states and 118 transitions. [2023-11-21 20:57:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 118 transitions. [2023-11-21 20:57:38,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2023-11-21 20:57:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 67 states have internal predecessors, (104), 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 20:57:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2023-11-21 20:57:38,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 104 transitions. [2023-11-21 20:57:38,291 INFO L428 stractBuchiCegarLoop]: Abstraction has 68 states and 104 transitions. [2023-11-21 20:57:38,291 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-21 20:57:38,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 104 transitions. [2023-11-21 20:57:38,292 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 20:57:38,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 20:57:38,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 20:57:38,295 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:38,295 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-21 20:57:38,296 INFO L748 eck$LassoCheckResult]: Stem: 1126#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1093#L565 assume !(main_~array_size~0#1 < 1); 1094#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1095#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1096#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1097#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1098#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1148#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1104#L552-4 lis_~i~0#1 := 1; 1105#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1124#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1103#L556 assume !lis_#t~short11#1; 1156#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1114#L555-2 [2023-11-21 20:57:38,296 INFO L750 eck$LassoCheckResult]: Loop: 1114#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1099#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1100#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1155#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1114#L555-2 [2023-11-21 20:57:38,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:38,297 INFO L85 PathProgramCache]: Analyzing trace with hash -793648193, now seen corresponding path program 1 times [2023-11-21 20:57:38,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:38,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296485480] [2023-11-21 20:57:38,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:38,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:38,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:38,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:38,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:38,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2511482, now seen corresponding path program 2 times [2023-11-21 20:57:38,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:38,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112419957] [2023-11-21 20:57:38,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:38,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:38,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:38,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:38,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:38,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1717295304, now seen corresponding path program 1 times [2023-11-21 20:57:38,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:38,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724031871] [2023-11-21 20:57:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-21 20:57:38,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:38,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724031871] [2023-11-21 20:57:38,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724031871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:38,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865931885] [2023-11-21 20:57:38,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:38,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:38,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:38,633 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:38,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-11-21 20:57:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:38,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 20:57:38,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-21 20:57:38,823 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 20:57:38,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865931885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:38,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 20:57:38,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-21 20:57:38,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198225007] [2023-11-21 20:57:38,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:39,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:39,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:57:39,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-11-21 20:57:39,203 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. cyclomatic complexity: 45 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 20:57:39,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:39,279 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2023-11-21 20:57:39,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 95 transitions. [2023-11-21 20:57:39,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 20:57:39,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 59 states and 82 transitions. [2023-11-21 20:57:39,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-11-21 20:57:39,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2023-11-21 20:57:39,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 82 transitions. [2023-11-21 20:57:39,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 20:57:39,282 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 82 transitions. [2023-11-21 20:57:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 82 transitions. [2023-11-21 20:57:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2023-11-21 20:57:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 50 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 20:57:39,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2023-11-21 20:57:39,292 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 73 transitions. [2023-11-21 20:57:39,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:57:39,293 INFO L428 stractBuchiCegarLoop]: Abstraction has 51 states and 73 transitions. [2023-11-21 20:57:39,295 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-21 20:57:39,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 73 transitions. [2023-11-21 20:57:39,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 20:57:39,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 20:57:39,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 20:57:39,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:39,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:39,298 INFO L748 eck$LassoCheckResult]: Stem: 1326#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1319#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1295#L565 assume !(main_~array_size~0#1 < 1); 1296#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1297#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1298#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1299#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1300#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1339#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1337#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1336#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1306#L552-4 lis_~i~0#1 := 1; 1307#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1324#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1341#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1340#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1328#L555-3 [2023-11-21 20:57:39,299 INFO L750 eck$LassoCheckResult]: Loop: 1328#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1334#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1338#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1335#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1333#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1331#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1329#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1328#L555-3 [2023-11-21 20:57:39,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1270630400, now seen corresponding path program 1 times [2023-11-21 20:57:39,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:39,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890874127] [2023-11-21 20:57:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:39,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-21 20:57:39,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890874127] [2023-11-21 20:57:39,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890874127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:39,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 20:57:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081288507] [2023-11-21 20:57:39,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:39,385 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 20:57:39,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 3 times [2023-11-21 20:57:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:39,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776675794] [2023-11-21 20:57:39,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:39,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:39,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:39,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:39,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:39,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:39,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 20:57:39,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 20:57:39,930 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. cyclomatic complexity: 26 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 20:57:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:39,982 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2023-11-21 20:57:39,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 70 transitions. [2023-11-21 20:57:39,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 20:57:39,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 70 transitions. [2023-11-21 20:57:39,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2023-11-21 20:57:39,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2023-11-21 20:57:39,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 70 transitions. [2023-11-21 20:57:39,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 20:57:39,984 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 70 transitions. [2023-11-21 20:57:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 70 transitions. [2023-11-21 20:57:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2023-11-21 20:57:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 48 states have internal predecessors, (69), 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 20:57:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2023-11-21 20:57:39,989 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 69 transitions. [2023-11-21 20:57:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 20:57:39,995 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 69 transitions. [2023-11-21 20:57:39,995 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-21 20:57:39,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 69 transitions. [2023-11-21 20:57:39,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2023-11-21 20:57:39,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 20:57:39,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 20:57:39,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:39,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:39,997 INFO L748 eck$LassoCheckResult]: Stem: 1433#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1428#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1403#L565 assume !(main_~array_size~0#1 < 1); 1404#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1405#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1406#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1407#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1408#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1448#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1437#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1436#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1409#L552-4 lis_~i~0#1 := 1; 1410#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1411#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1412#L556 assume !lis_#t~short11#1; 1416#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 1421#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1424#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1430#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1431#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1439#L555-3 [2023-11-21 20:57:39,997 INFO L750 eck$LassoCheckResult]: Loop: 1439#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1445#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1447#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1446#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1444#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1442#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1438#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1439#L555-3 [2023-11-21 20:57:39,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1523485369, now seen corresponding path program 1 times [2023-11-21 20:57:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:39,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343439193] [2023-11-21 20:57:39,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:39,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:40,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:40,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:40,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:40,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1050911964, now seen corresponding path program 4 times [2023-11-21 20:57:40,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:40,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628601607] [2023-11-21 20:57:40,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:40,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:40,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:40,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:40,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1322701164, now seen corresponding path program 1 times [2023-11-21 20:57:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:40,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946857414] [2023-11-21 20:57:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:40,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 20:57:40,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:40,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946857414] [2023-11-21 20:57:40,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946857414] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:40,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765005249] [2023-11-21 20:57:40,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:40,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:40,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:40,270 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:40,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-11-21 20:57:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:40,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-21 20:57:40,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 20:57:40,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 20:57:40,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765005249] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:40,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:40,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-11-21 20:57:40,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415620064] [2023-11-21 20:57:40,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:40,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:40,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 20:57:40,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-21 20:57:40,959 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. cyclomatic complexity: 24 Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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 20:57:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:41,114 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2023-11-21 20:57:41,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 87 transitions. [2023-11-21 20:57:41,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2023-11-21 20:57:41,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 40 states and 54 transitions. [2023-11-21 20:57:41,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-11-21 20:57:41,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-11-21 20:57:41,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 54 transitions. [2023-11-21 20:57:41,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 20:57:41,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 54 transitions. [2023-11-21 20:57:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 54 transitions. [2023-11-21 20:57:41,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2023-11-21 20:57:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:41,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2023-11-21 20:57:41,120 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 49 transitions. [2023-11-21 20:57:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 20:57:41,127 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2023-11-21 20:57:41,129 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-21 20:57:41,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 49 transitions. [2023-11-21 20:57:41,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2023-11-21 20:57:41,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 20:57:41,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 20:57:41,131 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:41,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2023-11-21 20:57:41,132 INFO L748 eck$LassoCheckResult]: Stem: 1710#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1706#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1689#L565 assume !(main_~array_size~0#1 < 1); 1690#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1691#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1692#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1693#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1694#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1713#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1712#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1711#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1697#L552-4 lis_~i~0#1 := 1; 1698#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1709#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1724#L556 assume !lis_#t~short11#1; 1721#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1719#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1718#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1707#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1708#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1715#L555-3 [2023-11-21 20:57:41,132 INFO L750 eck$LassoCheckResult]: Loop: 1715#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1723#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1720#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1703#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1695#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1696#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1699#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1702#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1717#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1716#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1714#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1715#L555-3 [2023-11-21 20:57:41,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:41,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1521638327, now seen corresponding path program 1 times [2023-11-21 20:57:41,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:41,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061103968] [2023-11-21 20:57:41,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-21 20:57:41,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:41,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061103968] [2023-11-21 20:57:41,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061103968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:57:41,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:57:41,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:57:41,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242329445] [2023-11-21 20:57:41,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:57:41,193 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-11-21 20:57:41,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:41,193 INFO L85 PathProgramCache]: Analyzing trace with hash 178424733, now seen corresponding path program 5 times [2023-11-21 20:57:41,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:41,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659446812] [2023-11-21 20:57:41,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:41,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:41,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:41,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:42,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:42,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:57:42,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:57:42,198 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 20:57:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:42,221 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2023-11-21 20:57:42,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2023-11-21 20:57:42,222 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2023-11-21 20:57:42,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 51 transitions. [2023-11-21 20:57:42,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2023-11-21 20:57:42,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2023-11-21 20:57:42,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 51 transitions. [2023-11-21 20:57:42,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 20:57:42,224 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 51 transitions. [2023-11-21 20:57:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 51 transitions. [2023-11-21 20:57:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2023-11-21 20:57:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 states have internal predecessors, (50), 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 20:57:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2023-11-21 20:57:42,227 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-11-21 20:57:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:57:42,228 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2023-11-21 20:57:42,229 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-21 20:57:42,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2023-11-21 20:57:42,229 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2023-11-21 20:57:42,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 20:57:42,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 20:57:42,231 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:42,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2023-11-21 20:57:42,231 INFO L748 eck$LassoCheckResult]: Stem: 1795#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1791#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1773#L565 assume !(main_~array_size~0#1 < 1); 1774#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 1775#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1776#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1777#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1778#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1798#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1797#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 1796#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 1779#L552-4 lis_~i~0#1 := 1; 1780#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1810#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1809#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1808#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1805#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1803#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1793#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1794#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1781#L555-3 [2023-11-21 20:57:42,231 INFO L750 eck$LassoCheckResult]: Loop: 1781#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1782#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1811#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1788#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1789#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 1802#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 1806#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 1804#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 1801#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 1800#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 1799#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 1781#L555-3 [2023-11-21 20:57:42,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:42,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1464380025, now seen corresponding path program 2 times [2023-11-21 20:57:42,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:42,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508827370] [2023-11-21 20:57:42,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:42,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:42,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:42,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:42,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:42,304 INFO L85 PathProgramCache]: Analyzing trace with hash 178424733, now seen corresponding path program 6 times [2023-11-21 20:57:42,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:42,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474527190] [2023-11-21 20:57:42,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:42,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:42,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:42,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:42,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1769023013, now seen corresponding path program 3 times [2023-11-21 20:57:42,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:42,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466210632] [2023-11-21 20:57:42,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:42,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 20:57:42,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:42,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466210632] [2023-11-21 20:57:42,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466210632] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:42,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899625139] [2023-11-21 20:57:42,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 20:57:42,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:42,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:42,661 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:42,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-11-21 20:57:42,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-21 20:57:42,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 20:57:42,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 20:57:42,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-21 20:57:43,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:57:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-21 20:57:43,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899625139] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:57:43,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 20:57:43,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2023-11-21 20:57:43,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634560953] [2023-11-21 20:57:43,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 20:57:44,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:57:44,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-21 20:57:44,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2023-11-21 20:57:44,313 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. cyclomatic complexity: 14 Second operand has 26 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:57:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 20:57:44,945 INFO L93 Difference]: Finished difference Result 125 states and 163 transitions. [2023-11-21 20:57:44,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 163 transitions. [2023-11-21 20:57:44,947 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 31 [2023-11-21 20:57:44,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 101 states and 133 transitions. [2023-11-21 20:57:44,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2023-11-21 20:57:44,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2023-11-21 20:57:44,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 133 transitions. [2023-11-21 20:57:44,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 20:57:44,949 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 133 transitions. [2023-11-21 20:57:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 133 transitions. [2023-11-21 20:57:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2023-11-21 20:57:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.3) internal successors, (91), 69 states have internal predecessors, (91), 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 20:57:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2023-11-21 20:57:44,962 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 91 transitions. [2023-11-21 20:57:44,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 20:57:44,970 INFO L428 stractBuchiCegarLoop]: Abstraction has 70 states and 91 transitions. [2023-11-21 20:57:44,970 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-11-21 20:57:44,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 91 transitions. [2023-11-21 20:57:44,970 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2023-11-21 20:57:44,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 20:57:44,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 20:57:44,971 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:44,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-11-21 20:57:44,972 INFO L748 eck$LassoCheckResult]: Stem: 2196#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2191#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2174#L565 assume !(main_~array_size~0#1 < 1); 2175#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2176#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2177#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2202#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2204#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2178#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2179#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2243#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 2242#L552-4 lis_~i~0#1 := 1; 2241#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2238#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2235#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2231#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2229#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2227#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2194#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2195#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2180#L555-3 [2023-11-21 20:57:44,972 INFO L750 eck$LassoCheckResult]: Loop: 2180#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2181#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2184#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2188#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2180#L555-3 [2023-11-21 20:57:44,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:44,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1464380025, now seen corresponding path program 4 times [2023-11-21 20:57:44,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:44,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173104973] [2023-11-21 20:57:44,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:44,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:45,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:45,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:45,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:45,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272, now seen corresponding path program 3 times [2023-11-21 20:57:45,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:45,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060477796] [2023-11-21 20:57:45,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:45,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:45,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:45,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:45,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash -710990816, now seen corresponding path program 5 times [2023-11-21 20:57:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:45,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756730732] [2023-11-21 20:57:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:45,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:45,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 20:57:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 20:57:45,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 20:57:51,943 INFO L210 LassoAnalysis]: Preferences: [2023-11-21 20:57:51,943 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-11-21 20:57:51,943 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-11-21 20:57:51,943 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-11-21 20:57:51,943 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-11-21 20:57:51,943 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:51,943 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-11-21 20:57:51,943 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-11-21 20:57:51,943 INFO L133 ssoRankerPreferences]: Filename of dumped script: lis-alloca-2.i_Iteration11_Lasso [2023-11-21 20:57:51,943 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-11-21 20:57:51,943 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-11-21 20:57:51,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:51,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:51,951 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 20:57:51,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:53,967 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 20:57:53,970 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 20:57:53,973 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 20:57:53,975 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 20:57:53,978 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 20:57:53,980 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 20:57:53,982 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 20:57:53,984 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 20:57:53,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:53,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:53,992 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 20:57:53,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:53,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:54,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:54,002 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 20:57:54,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:54,007 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 20:57:54,010 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 20:57:54,012 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 20:57:54,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:54,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-11-21 20:57:54,687 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-11-21 20:57:54,687 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-11-21 20:57:54,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:54,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:54,697 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:54,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-11-21 20:57:54,699 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 20:57:54,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:54,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:54,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:54,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:54,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:54,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:54,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:54,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:54,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:54,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:54,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:54,724 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:54,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-11-21 20:57:54,726 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 20:57:54,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:54,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:54,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:54,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:54,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:54,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:54,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:54,737 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:54,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:54,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:54,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:54,749 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:54,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-11-21 20:57:54,752 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 20:57:54,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:54,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-11-21 20:57:54,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:54,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:54,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:54,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-11-21 20:57:54,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-11-21 20:57:54,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:54,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2023-11-21 20:57:54,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:54,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:54,780 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:54,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-11-21 20:57:54,781 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 20:57:54,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:54,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:54,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:54,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:54,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:54,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:54,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:54,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-11-21 20:57:54,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:54,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:54,822 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:54,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-11-21 20:57:54,823 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 20:57:54,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:54,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:54,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:54,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:54,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:54,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:54,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:54,854 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:54,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:54,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:54,856 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:54,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-11-21 20:57:54,862 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 20:57:54,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:54,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:54,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:54,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:54,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:54,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:54,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:54,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2023-11-21 20:57:54,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:54,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:54,892 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:54,894 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 20:57:54,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-11-21 20:57:54,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:54,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:54,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:54,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:54,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:54,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:54,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:54,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2023-11-21 20:57:54,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:54,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:54,927 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:54,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-11-21 20:57:54,929 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 20:57:54,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:54,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:54,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:54,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:54,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:54,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:54,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:54,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:54,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:54,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:54,957 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:54,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-11-21 20:57:54,958 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 20:57:54,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:54,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:54,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:54,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:54,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:54,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:54,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:55,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-11-21 20:57:55,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:55,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:55,011 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:55,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-11-21 20:57:55,013 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 20:57:55,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:55,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:55,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:55,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:55,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:55,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:55,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-11-21 20:57:55,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2023-11-21 20:57:55,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:55,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:55,043 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:55,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-11-21 20:57:55,044 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 20:57:55,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-11-21 20:57:55,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-11-21 20:57:55,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-11-21 20:57:55,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-11-21 20:57:55,063 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-11-21 20:57:55,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-11-21 20:57:55,080 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-11-21 20:57:55,121 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2023-11-21 20:57:55,122 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. [2023-11-21 20:57:55,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 20:57:55,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:55,127 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 20:57:55,128 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-11-21 20:57:55,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-11-21 20:57:55,141 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-11-21 20:57:55,142 INFO L513 LassoAnalysis]: Proved termination. [2023-11-21 20:57:55,142 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_lis_~j~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc17#1.base)_3) = -2*ULTIMATE.start_lis_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc17#1.base)_3 Supporting invariants [] [2023-11-21 20:57:55,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2023-11-21 20:57:55,396 INFO L156 tatePredicateManager]: 34 out of 36 supporting invariants were superfluous and have been removed [2023-11-21 20:57:55,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #length[#t~malloc17!base] could not be translated [2023-11-21 20:57:55,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:55,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 20:57:55,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:55,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-21 20:57:55,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:55,666 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 20:57:55,667 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2023-11-21 20:57:55,667 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 91 transitions. cyclomatic complexity: 26 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20:57:55,704 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 91 transitions. cyclomatic complexity: 26. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 91 transitions. Complement of second has 5 states. [2023-11-21 20:57:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2023-11-21 20:57:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20:57:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2023-11-21 20:57:55,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 20 letters. Loop has 4 letters. [2023-11-21 20:57:55,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:55,708 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-21 20:57:55,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:55,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 20:57:55,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:55,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-21 20:57:55,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:56,012 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 20:57:56,013 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 2 loop predicates [2023-11-21 20:57:56,013 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 91 transitions. cyclomatic complexity: 26 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20:57:56,059 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 91 transitions. cyclomatic complexity: 26. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 70 states and 91 transitions. Complement of second has 5 states. [2023-11-21 20:57:56,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2023-11-21 20:57:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20:57:56,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2023-11-21 20:57:56,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 20 letters. Loop has 4 letters. [2023-11-21 20:57:56,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:56,061 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-11-21 20:57:56,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:56,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 20:57:56,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:56,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-21 20:57:56,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:56,332 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 20:57:56,333 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2023-11-21 20:57:56,333 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 91 transitions. cyclomatic complexity: 26 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20:57:56,472 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 91 transitions. cyclomatic complexity: 26. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 84 states and 113 transitions. Complement of second has 11 states. [2023-11-21 20:57:56,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2023-11-21 20:57:56,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20:57:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2023-11-21 20:57:56,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 52 transitions. Stem has 20 letters. Loop has 4 letters. [2023-11-21 20:57:56,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:56,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 52 transitions. Stem has 24 letters. Loop has 4 letters. [2023-11-21 20:57:56,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:56,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 52 transitions. Stem has 20 letters. Loop has 8 letters. [2023-11-21 20:57:56,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-11-21 20:57:56,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2023-11-21 20:57:56,476 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2023-11-21 20:57:56,477 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 54 states and 70 transitions. [2023-11-21 20:57:56,477 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2023-11-21 20:57:56,477 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2023-11-21 20:57:56,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 70 transitions. [2023-11-21 20:57:56,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-11-21 20:57:56,478 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 70 transitions. [2023-11-21 20:57:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 70 transitions. [2023-11-21 20:57:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-21 20:57:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 53 states have internal predecessors, (70), 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 20:57:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2023-11-21 20:57:56,481 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 70 transitions. [2023-11-21 20:57:56,482 INFO L428 stractBuchiCegarLoop]: Abstraction has 54 states and 70 transitions. [2023-11-21 20:57:56,482 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-11-21 20:57:56,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 70 transitions. [2023-11-21 20:57:56,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2023-11-21 20:57:56,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 20:57:56,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 20:57:56,484 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:56,484 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 20:57:56,484 INFO L748 eck$LassoCheckResult]: Stem: 2915#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2912#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~ret18#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;havoc main_#t~nondet16#1;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 2888#L565 assume !(main_~array_size~0#1 < 1); 2889#L565-2 call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1 % 18446744073709551616);main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(4 * lis_~N#1 % 18446744073709551616);lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0; 2890#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2891#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2892#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2893#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2926#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2924#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2921#L552-3 assume !!(lis_~i~0#1 < lis_~N#1);call write~int#1(1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call write~int#0(lis_~i~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2917#L552-2 lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post4#1;havoc lis_#t~post4#1; 2916#L552-3 assume !(lis_~i~0#1 < lis_~N#1); 2899#L552-4 lis_~i~0#1 := 1; 2900#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2894#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2896#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2941#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2907#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2909#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2936#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2934#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2931#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2902#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2903#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2908#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2897#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2898#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2939#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2938#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2937#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2913#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2914#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2919#L555-3 [2023-11-21 20:57:56,484 INFO L750 eck$LassoCheckResult]: Loop: 2919#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2935#L556 assume lis_#t~short11#1;call lis_#t~mem10#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem9#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem10#1 < 1 + lis_#t~mem9#1; 2932#L556-2 assume lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1;call lis_#t~mem12#1 := read~int#1(lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~j~0#1, 4);call write~int#1(1 + lis_#t~mem12#1, lis_~best~0#1.base, lis_~best~0#1.offset + 4 * lis_~i~0#1, 4);havoc lis_#t~mem12#1;call write~int#0(lis_~j~0#1, lis_~prev~0#1.base, lis_~prev~0#1.offset + 4 * lis_~i~0#1, 4); 2930#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2929#L555-3 assume !!(lis_~j~0#1 < lis_~i~0#1);call lis_#t~mem7#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~i~0#1, 4);call lis_#t~mem8#1 := read~int#2(lis_~a#1.base, lis_~a#1.offset + 4 * lis_~j~0#1, 4);lis_#t~short11#1 := lis_#t~mem7#1 > lis_#t~mem8#1; 2923#L556 assume !lis_#t~short11#1; 2928#L556-2 assume !lis_#t~short11#1;havoc lis_#t~mem7#1;havoc lis_#t~mem8#1;havoc lis_#t~mem10#1;havoc lis_#t~mem9#1;havoc lis_#t~short11#1; 2925#L555-2 lis_#t~post6#1 := lis_~j~0#1;lis_~j~0#1 := 1 + lis_#t~post6#1;havoc lis_#t~post6#1; 2922#L555-3 assume !(lis_~j~0#1 < lis_~i~0#1); 2920#L554-2 lis_#t~post5#1 := lis_~i~0#1;lis_~i~0#1 := 1 + lis_#t~post5#1;havoc lis_#t~post5#1; 2918#L554-3 assume !!(lis_~i~0#1 < lis_~N#1);lis_~j~0#1 := 0; 2919#L555-3 [2023-11-21 20:57:56,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:57:56,485 INFO L85 PathProgramCache]: Analyzing trace with hash -205154041, now seen corresponding path program 1 times [2023-11-21 20:57:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:57:56,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038888068] [2023-11-21 20:57:56,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:56,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:57:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:56,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2023-11-21 20:57:58,663 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:58,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:57:58,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038888068] [2023-11-21 20:57:58,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038888068] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 20:57:58,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527764799] [2023-11-21 20:57:58,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:57:58,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:57:58,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:57:58,666 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 20:57:58,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bc49cee-cfd6-4a21-9658-000e1aea9a7b/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2023-11-21 20:57:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:57:58,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-21 20:57:58,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:57:58,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-21 20:57:58,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-11-21 20:57:59,065 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2023-11-21 20:57:59,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 25 [2023-11-21 20:57:59,332 INFO L349 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2023-11-21 20:57:59,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 53 [2023-11-21 20:57:59,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 20:57:59,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2023-11-21 20:57:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:57:59,702 INFO L327 TraceCheckSpWp]: Computing backward predicates...