./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i --full-output --architecture 64bit
--------------------------------------------------------------------------------
Checking for termination
Using default analysis
Version a0165632
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_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX --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 e6d71d49c6e185294c0f1f4729e12b8d7df6d1365b5d24a48890a0be5b6780c4
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:42:25,152 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:42:25,258 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-64bit-Automizer_Default.epf
[2024-11-08 17:42:25,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:42:25,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:42:25,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:42:25,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:42:25,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:42:25,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 17:42:25,303 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 17:42:25,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:42:25,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 17:42:25,305 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 17:42:25,308 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-08 17:42:25,309 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2024-11-08 17:42:25,309 INFO L153 SettingsManager]: * Use old map elimination=false
[2024-11-08 17:42:25,309 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false
[2024-11-08 17:42:25,314 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true
[2024-11-08 17:42:25,314 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-08 17:42:25,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:42:25,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2024-11-08 17:42:25,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 17:42:25,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 17:42:25,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2024-11-08 17:42:25,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-08 17:42:25,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2024-11-08 17:42:25,318 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 17:42:25,318 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-08 17:42:25,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 17:42:25,319 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false
[2024-11-08 17:42:25,323 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 17:42:25,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:42:25,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 17:42:25,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:42:25,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 17:42:25,326 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-08 17:42:25,326 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_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/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_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX
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 -> e6d71d49c6e185294c0f1f4729e12b8d7df6d1365b5d24a48890a0be5b6780c4
[2024-11-08 17:42:25,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:42:25,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:42:25,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:42:25,685 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 17:42:25,686 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 17:42:25,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i
Unable to find full path for "g++"
[2024-11-08 17:42:28,153 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:42:28,421 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 17:42:28,422 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i
[2024-11-08 17:42:28,434 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/data/355457dbf/82791748b5424a17a9747b6ae538479e/FLAG5492ad18c
[2024-11-08 17:42:28,458 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/data/355457dbf/82791748b5424a17a9747b6ae538479e
[2024-11-08 17:42:28,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:42:28,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:42:28,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:42:28,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:42:28,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:42:28,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@517c5b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28, skipping insertion in model container
[2024-11-08 17:42:28,488 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,522 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:42:28,787 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:42:28,810 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 17:42:28,833 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:42:28,859 INFO L204 MainTranslator]: Completed translation
[2024-11-08 17:42:28,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28 WrapperNode
[2024-11-08 17:42:28,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:42:28,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:42:28,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:42:28,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:42:28,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,908 INFO L138 Inliner]: procedures = 12, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100
[2024-11-08 17:42:28,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:42:28,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:42:28,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:42:28,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:42:28,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,948 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 3 writes are split as follows [1, 2].
[2024-11-08 17:42:28,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:42:28,968 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:42:28,969 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:42:28,969 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:42:28,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28" (1/1) ...
[2024-11-08 17:42:28,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:28,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:29,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:29,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-11-08 17:42:29,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-08 17:42:29,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-08 17:42:29,063 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort
[2024-11-08 17:42:29,063 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort
[2024-11-08 17:42:29,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-08 17:42:29,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:42:29,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:42:29,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-08 17:42:29,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-08 17:42:29,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-11-08 17:42:29,162 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 17:42:29,166 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:42:29,500 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live.
[2024-11-08 17:42:29,501 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 17:42:29,521 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:42:29,525 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 17:42:29,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:42:29 BoogieIcfgContainer
[2024-11-08 17:42:29,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:42:29,527 INFO L112 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-08 17:42:29,527 INFO L270 PluginConnector]: Initializing BuchiAutomizer...
[2024-11-08 17:42:29,535 INFO L274 PluginConnector]: BuchiAutomizer initialized
[2024-11-08 17:42:29,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 17:42:29,537 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 05:42:28" (1/3) ...
[2024-11-08 17:42:29,539 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bd48bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 05:42:29, skipping insertion in model container
[2024-11-08 17:42:29,539 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 17:42:29,539 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:42:28" (2/3) ...
[2024-11-08 17:42:29,541 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bd48bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 05:42:29, skipping insertion in model container
[2024-11-08 17:42:29,541 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 17:42:29,542 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:42:29" (3/3) ...
[2024-11-08 17:42:29,544 INFO L332 chiAutomizerObserver]: Analyzing ICFG mergeSort.i
[2024-11-08 17:42:29,630 INFO L300 stractBuchiCegarLoop]: Interprodecural is true
[2024-11-08 17:42:29,630 INFO L301 stractBuchiCegarLoop]: Hoare is None
[2024-11-08 17:42:29,630 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-08 17:42:29,630 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-08 17:42:29,631 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-08 17:42:29,631 INFO L305 stractBuchiCegarLoop]: Difference is false
[2024-11-08 17:42:29,631 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-08 17:42:29,632 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-08 17:42:29,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 17:42:29,666 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16
[2024-11-08 17:42:29,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:29,667 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:29,676 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-08 17:42:29,676 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:42:29,676 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-08 17:42:29,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 17:42:29,687 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16
[2024-11-08 17:42:29,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:29,687 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:29,688 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-08 17:42:29,688 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:42:29,698 INFO L745 eck$LassoCheckResult]: Stem: 29#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 17#L35true assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 12#L40-3true
[2024-11-08 17:42:29,699 INFO L747 eck$LassoCheckResult]: Loop: 12#L40-3true assume main_~i~1#1 < main_~n~0#1; 27#L40-1true assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 12#L40-3true
[2024-11-08 17:42:29,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash 87454, now seen corresponding path program 1 times
[2024-11-08 17:42:29,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:29,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646097634]
[2024-11-08 17:42:29,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:29,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:29,918 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:29,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:30,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash 3174, now seen corresponding path program 1 times
[2024-11-08 17:42:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:30,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396677214]
[2024-11-08 17:42:30,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:30,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:30,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:30,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:30,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:30,049 INFO L85 PathProgramCache]: Analyzing trace with hash 84045507, now seen corresponding path program 1 times
[2024-11-08 17:42:30,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:30,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680929158]
[2024-11-08 17:42:30,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:30,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:30,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:30,493 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 17:42:30,494 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 17:42:30,494 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 17:42:30,494 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 17:42:30,495 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 17:42:30,495 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:30,495 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 17:42:30,495 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 17:42:30,495 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso
[2024-11-08 17:42:30,495 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 17:42:30,496 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 17:42:30,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:30,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:30,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:30,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:30,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:30,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:30,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:30,997 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 17:42:31,002 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 17:42:31,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:31,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:31,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:31,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process
[2024-11-08 17:42:31,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:31,035 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:31,036 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts
[2024-11-08 17:42:31,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:31,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:31,044 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications.
[2024-11-08 17:42:31,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:42:31,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:31,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:31,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:31,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:31,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:31,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process
[2024-11-08 17:42:31,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:31,111 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:31,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:31,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:31,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:31,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:31,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:31,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:31,119 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:31,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0
[2024-11-08 17:42:31,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:31,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:31,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:31,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process
[2024-11-08 17:42:31,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:31,166 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:31,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:31,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:31,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:31,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:42:31,172 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:42:31,180 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:31,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0
[2024-11-08 17:42:31,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:31,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:31,206 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:31,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2024-11-08 17:42:31,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:31,228 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:31,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:31,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:31,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:31,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:42:31,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:42:31,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:31,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0
[2024-11-08 17:42:31,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:31,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:31,270 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:31,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2024-11-08 17:42:31,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:31,294 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:31,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:31,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:31,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:31,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:42:31,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:42:31,335 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 17:42:31,372 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver.
[2024-11-08 17:42:31,372 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero.
[2024-11-08 17:42:31,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:31,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:31,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:31,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process
[2024-11-08 17:42:31,394 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 17:42:31,416 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2.
[2024-11-08 17:42:31,416 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 17:42:31,417 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1, ULTIMATE.start_main_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1 - 4*ULTIMATE.start_main_~i~1#1
Supporting invariants [1*ULTIMATE.start_main_~a~0#1.offset >= 0]
[2024-11-08 17:42:31,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:31,456 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed
[2024-11-08 17:42:31,470 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length
[2024-11-08 17:42:31,471 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
[2024-11-08 17:42:31,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:31,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:31,557 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:31,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:31,590 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:42:31,668 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates
[2024-11-08 17:42:31,671 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:42:31,775 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 37 states and 50 transitions. Complement of second has 5 states.
[2024-11-08 17:42:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-08 17:42:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:42:31,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions.
[2024-11-08 17:42:31,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 2 letters.
[2024-11-08 17:42:31,793 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:42:31,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 2 letters.
[2024-11-08 17:42:31,793 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:42:31,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 4 letters.
[2024-11-08 17:42:31,794 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:42:31,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions.
[2024-11-08 17:42:31,801 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-08 17:42:31,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 30 states and 43 transitions.
[2024-11-08 17:42:31,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26
[2024-11-08 17:42:31,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28
[2024-11-08 17:42:31,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions.
[2024-11-08 17:42:31,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:31,819 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 43 transitions.
[2024-11-08 17:42:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions.
[2024-11-08 17:42:31,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29.
[2024-11-08 17:42:31,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-08 17:42:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions.
[2024-11-08 17:42:31,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 42 transitions.
[2024-11-08 17:42:31,863 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 42 transitions.
[2024-11-08 17:42:31,863 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-08 17:42:31,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions.
[2024-11-08 17:42:31,865 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-08 17:42:31,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:31,868 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:31,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:31,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-08 17:42:31,870 INFO L745 eck$LassoCheckResult]: Stem: 146#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 128#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 129#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 136#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 139#L40-4 havoc main_~i~1#1; 118#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 119#$Ultimate##0
[2024-11-08 17:42:31,870 INFO L747 eck$LassoCheckResult]: Loop: 119#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 145#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 121#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 119#$Ultimate##0
[2024-11-08 17:42:31,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:31,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1689549640, now seen corresponding path program 1 times
[2024-11-08 17:42:31,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:31,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958678672]
[2024-11-08 17:42:31,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:31,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:31,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:42:32,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:42:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958678672]
[2024-11-08 17:42:32,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958678672] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:42:32,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:42:32,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:42:32,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746012727]
[2024-11-08 17:42:32,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:42:32,081 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:42:32,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash 29999, now seen corresponding path program 1 times
[2024-11-08 17:42:32,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:32,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93354497]
[2024-11-08 17:42:32,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:32,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:32,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:32,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:42:32,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:42:32,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:42:32,486 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:42:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:42:32,520 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions.
[2024-11-08 17:42:32,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions.
[2024-11-08 17:42:32,522 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-08 17:42:32,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 41 transitions.
[2024-11-08 17:42:32,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27
[2024-11-08 17:42:32,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27
[2024-11-08 17:42:32,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 41 transitions.
[2024-11-08 17:42:32,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:32,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 41 transitions.
[2024-11-08 17:42:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 41 transitions.
[2024-11-08 17:42:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29.
[2024-11-08 17:42:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-08 17:42:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions.
[2024-11-08 17:42:32,536 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 40 transitions.
[2024-11-08 17:42:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 17:42:32,539 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 40 transitions.
[2024-11-08 17:42:32,539 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-11-08 17:42:32,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions.
[2024-11-08 17:42:32,540 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-08 17:42:32,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:32,541 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:32,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:32,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-08 17:42:32,543 INFO L745 eck$LassoCheckResult]: Stem: 212#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 194#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 195#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 202#L40-3 assume main_~i~1#1 < main_~n~0#1; 203#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 204#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 206#L40-4 havoc main_~i~1#1; 184#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 185#$Ultimate##0
[2024-11-08 17:42:32,544 INFO L747 eck$LassoCheckResult]: Loop: 185#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 211#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 188#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 185#$Ultimate##0
[2024-11-08 17:42:32,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:32,544 INFO L85 PathProgramCache]: Analyzing trace with hash -166158989, now seen corresponding path program 1 times
[2024-11-08 17:42:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:32,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962317049]
[2024-11-08 17:42:32,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:32,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:32,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:32,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:32,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:32,609 INFO L85 PathProgramCache]: Analyzing trace with hash 29999, now seen corresponding path program 2 times
[2024-11-08 17:42:32,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:32,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632059941]
[2024-11-08 17:42:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:32,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:32,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:32,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:32,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:32,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2054851197, now seen corresponding path program 1 times
[2024-11-08 17:42:32,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:32,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815208875]
[2024-11-08 17:42:32,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:32,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:42:32,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:42:32,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815208875]
[2024-11-08 17:42:32,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815208875] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:42:32,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994969905]
[2024-11-08 17:42:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:32,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:42:32,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:32,901 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:42:32,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-08 17:42:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:32,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:32,995 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:42:33,044 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:42:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:42:33,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994969905] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:42:33,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:42:33,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8
[2024-11-08 17:42:33,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456116803]
[2024-11-08 17:42:33,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:42:33,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:42:33,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 17:42:33,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-11-08 17:42:33,432 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. cyclomatic complexity: 15 Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:42:33,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:42:33,544 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions.
[2024-11-08 17:42:33,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions.
[2024-11-08 17:42:33,545 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-08 17:42:33,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 32 states and 43 transitions.
[2024-11-08 17:42:33,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27
[2024-11-08 17:42:33,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27
[2024-11-08 17:42:33,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions.
[2024-11-08 17:42:33,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:33,551 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 43 transitions.
[2024-11-08 17:42:33,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions.
[2024-11-08 17:42:33,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31.
[2024-11-08 17:42:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-08 17:42:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions.
[2024-11-08 17:42:33,557 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions.
[2024-11-08 17:42:33,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 17:42:33,559 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions.
[2024-11-08 17:42:33,560 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============
[2024-11-08 17:42:33,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions.
[2024-11-08 17:42:33,562 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-08 17:42:33,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:33,562 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:33,563 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:33,563 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-08 17:42:33,563 INFO L745 eck$LassoCheckResult]: Stem: 356#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 338#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 345#L40-3 assume main_~i~1#1 < main_~n~0#1; 346#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 347#L40-3 assume main_~i~1#1 < main_~n~0#1; 348#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 357#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 355#L40-4 havoc main_~i~1#1; 327#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 328#$Ultimate##0
[2024-11-08 17:42:33,563 INFO L747 eck$LassoCheckResult]: Loop: 328#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 353#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 331#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 328#$Ultimate##0
[2024-11-08 17:42:33,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:33,564 INFO L85 PathProgramCache]: Analyzing trace with hash -771591314, now seen corresponding path program 2 times
[2024-11-08 17:42:33,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:33,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012262536]
[2024-11-08 17:42:33,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:33,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:33,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:33,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:33,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash 29999, now seen corresponding path program 3 times
[2024-11-08 17:42:33,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:33,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530852435]
[2024-11-08 17:42:33,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:33,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:33,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:33,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:33,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:33,620 INFO L85 PathProgramCache]: Analyzing trace with hash 188133026, now seen corresponding path program 2 times
[2024-11-08 17:42:33,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:33,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137193475]
[2024-11-08 17:42:33,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:33,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:33,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:33,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:34,675 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 17:42:34,675 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 17:42:34,675 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 17:42:34,675 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 17:42:34,676 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 17:42:34,676 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:34,676 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 17:42:34,676 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 17:42:34,676 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso
[2024-11-08 17:42:34,676 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 17:42:34,676 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 17:42:34,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:34,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:34,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:34,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:34,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:34,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:34,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:34,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:34,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:34,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:34,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:34,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:34,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:34,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,014 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:35,649 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 17:42:35,649 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 17:42:35,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:35,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:35,652 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:35,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process
[2024-11-08 17:42:35,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:35,680 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:35,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:35,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:35,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:35,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:35,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:35,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:35,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:35,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:35,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:35,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:35,708 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:35,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process
[2024-11-08 17:42:35,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:35,728 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:35,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:35,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:35,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:35,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:35,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:35,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:35,733 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:35,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0
[2024-11-08 17:42:35,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:35,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:35,757 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:35,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process
[2024-11-08 17:42:35,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:35,779 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:35,779 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:35,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:35,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:35,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:35,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:35,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:35,785 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:35,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0
[2024-11-08 17:42:35,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:35,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:35,809 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:35,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process
[2024-11-08 17:42:35,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:35,830 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:35,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:35,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:35,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:35,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:35,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:35,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:35,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:35,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:35,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:35,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:35,860 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:35,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process
[2024-11-08 17:42:35,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
[2024-11-08 17:42:35,879 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:35,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:35,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:35,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:35,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:35,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:35,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:35,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:35,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0
[2024-11-08 17:42:35,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:35,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:35,933 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:35,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process
[2024-11-08 17:42:35,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:35,952 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:35,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:35,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:35,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:35,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:35,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:35,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:35,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:35,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:35,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:35,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:35,975 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:35,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process
[2024-11-08 17:42:35,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:35,991 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:35,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:35,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:35,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:35,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:35,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:35,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:35,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:36,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:36,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:36,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:36,012 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:36,013 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process
[2024-11-08 17:42:36,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:36,028 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:36,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:36,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:36,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:36,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:42:36,036 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:42:36,054 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 17:42:36,086 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver.
[2024-11-08 17:42:36,086 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 11 variables to zero.
[2024-11-08 17:42:36,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:36,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:36,089 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:36,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process
[2024-11-08 17:42:36,092 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 17:42:36,111 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-08 17:42:36,111 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 17:42:36,111 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_#in~n#1) = 1*merge_sort_#in~n#1
Supporting invariants []
[2024-11-08 17:42:36,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0
[2024-11-08 17:42:36,142 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed
[2024-11-08 17:42:36,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:36,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:36,199 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:36,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:36,245 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:36,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:42:36,302 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
[2024-11-08 17:42:36,302 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 15 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:42:36,386 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 15. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 64 transitions. Complement of second has 16 states.
[2024-11-08 17:42:36,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states
[2024-11-08 17:42:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:42:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions.
[2024-11-08 17:42:36,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 3 letters.
[2024-11-08 17:42:36,390 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:42:36,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 3 letters.
[2024-11-08 17:42:36,390 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:42:36,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters.
[2024-11-08 17:42:36,390 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:42:36,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions.
[2024-11-08 17:42:36,393 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-08 17:42:36,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 40 states and 55 transitions.
[2024-11-08 17:42:36,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30
[2024-11-08 17:42:36,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31
[2024-11-08 17:42:36,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 55 transitions.
[2024-11-08 17:42:36,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:36,397 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 55 transitions.
[2024-11-08 17:42:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 55 transitions.
[2024-11-08 17:42:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38.
[2024-11-08 17:42:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-08 17:42:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions.
[2024-11-08 17:42:36,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 51 transitions.
[2024-11-08 17:42:36,411 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 51 transitions.
[2024-11-08 17:42:36,412 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============
[2024-11-08 17:42:36,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 51 transitions.
[2024-11-08 17:42:36,413 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14
[2024-11-08 17:42:36,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:36,413 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:36,414 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:36,414 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:36,414 INFO L745 eck$LassoCheckResult]: Stem: 524#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 504#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 505#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 509#L40-3 assume main_~i~1#1 < main_~n~0#1; 510#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 511#L40-3 assume main_~i~1#1 < main_~n~0#1; 512#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 525#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 523#L40-4 havoc main_~i~1#1; 490#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 491#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 520#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 495#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 519#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 521#L24 assume ~n#1 < 2; 517#merge_sortFINAL assume true; 516#merge_sortEXIT >#85#return; 494#L27-1
[2024-11-08 17:42:36,416 INFO L747 eck$LassoCheckResult]: Loop: 494#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 518#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 527#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 493#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 518#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 527#L24 assume ~n#1 < 2; 508#merge_sortFINAL assume true; 526#merge_sortEXIT >#85#return; 494#L27-1
[2024-11-08 17:42:36,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:36,419 INFO L85 PathProgramCache]: Analyzing trace with hash 488284193, now seen corresponding path program 1 times
[2024-11-08 17:42:36,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:36,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255855819]
[2024-11-08 17:42:36,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:36,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:36,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:36,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:36,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:36,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2057523910, now seen corresponding path program 1 times
[2024-11-08 17:42:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:36,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729329062]
[2024-11-08 17:42:36,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:36,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:36,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:36,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:36,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:36,530 INFO L85 PathProgramCache]: Analyzing trace with hash 912600410, now seen corresponding path program 1 times
[2024-11-08 17:42:36,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:36,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405457691]
[2024-11-08 17:42:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:36,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:36,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-08 17:42:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:36,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-08 17:42:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 17:42:36,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:42:36,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405457691]
[2024-11-08 17:42:36,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405457691] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:42:36,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251631202]
[2024-11-08 17:42:36,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:36,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:42:36,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:37,001 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:42:37,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process
[2024-11-08 17:42:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:37,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:37,107 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:42:37,197 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:42:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 17:42:37,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251631202] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:42:37,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:42:37,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15
[2024-11-08 17:42:37,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873424616]
[2024-11-08 17:42:37,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:42:37,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0
[2024-11-08 17:42:38,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:42:38,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-08 17:42:38,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210
[2024-11-08 17:42:38,034 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. cyclomatic complexity: 18 Second operand has 15 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 5 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5)
[2024-11-08 17:42:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:42:38,385 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions.
[2024-11-08 17:42:38,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 101 transitions.
[2024-11-08 17:42:38,387 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25
[2024-11-08 17:42:38,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 72 states and 95 transitions.
[2024-11-08 17:42:38,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59
[2024-11-08 17:42:38,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62
[2024-11-08 17:42:38,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 95 transitions.
[2024-11-08 17:42:38,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:38,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 95 transitions.
[2024-11-08 17:42:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 95 transitions.
[2024-11-08 17:42:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69.
[2024-11-08 17:42:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 58 states have internal predecessors, (75), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8)
[2024-11-08 17:42:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions.
[2024-11-08 17:42:38,397 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 90 transitions.
[2024-11-08 17:42:38,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-08 17:42:38,399 INFO L425 stractBuchiCegarLoop]: Abstraction has 69 states and 90 transitions.
[2024-11-08 17:42:38,399 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============
[2024-11-08 17:42:38,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 90 transitions.
[2024-11-08 17:42:38,401 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24
[2024-11-08 17:42:38,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:38,401 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:38,403 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:38,403 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:38,403 INFO L745 eck$LassoCheckResult]: Stem: 827#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 800#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 801#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 808#L40-3 assume main_~i~1#1 < main_~n~0#1; 809#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 843#L40-3 assume main_~i~1#1 < main_~n~0#1; 842#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 839#L40-3 assume main_~i~1#1 < main_~n~0#1; 811#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 810#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 813#L40-4 havoc main_~i~1#1; 794#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 830#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 822#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 793#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 820#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 823#L24 assume ~n#1 < 2; 824#merge_sortFINAL assume true; 817#merge_sortEXIT >#85#return; 792#L27-1
[2024-11-08 17:42:38,404 INFO L747 eck$LassoCheckResult]: Loop: 792#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 819#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 821#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 791#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 819#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 821#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 791#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 819#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 821#L24 assume ~n#1 < 2; 855#merge_sortFINAL assume true; 856#merge_sortEXIT >#85#return; 792#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 819#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 821#L24 assume ~n#1 < 2; 855#merge_sortFINAL assume true; 856#merge_sortEXIT >#87#return; 815#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 816#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 804#L11-4 merge_~i~0#1 := 0; 829#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 790#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 795#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 807#merge_sortFINAL assume true; 818#merge_sortEXIT >#85#return; 792#L27-1
[2024-11-08 17:42:38,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:38,404 INFO L85 PathProgramCache]: Analyzing trace with hash 913462406, now seen corresponding path program 2 times
[2024-11-08 17:42:38,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:38,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458357326]
[2024-11-08 17:42:38,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:38,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:38,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:38,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:38,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:38,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1708130100, now seen corresponding path program 1 times
[2024-11-08 17:42:38,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:38,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028859675]
[2024-11-08 17:42:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:38,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-08 17:42:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:38,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:42:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:42:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-11-08 17:42:38,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:42:38,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028859675]
[2024-11-08 17:42:38,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028859675] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:42:38,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460970797]
[2024-11-08 17:42:38,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:38,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:42:38,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:38,681 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:42:38,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process
[2024-11-08 17:42:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:38,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:38,789 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2024-11-08 17:42:38,827 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:42:38,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460970797] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:42:38,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 17:42:38,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7
[2024-11-08 17:42:38,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601043231]
[2024-11-08 17:42:38,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:42:38,829 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 17:42:38,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:42:38,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 17:42:38,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-08 17:42:38,830 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. cyclomatic complexity: 28 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2024-11-08 17:42:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:42:38,880 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions.
[2024-11-08 17:42:38,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 112 transitions.
[2024-11-08 17:42:38,882 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24
[2024-11-08 17:42:38,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 112 transitions.
[2024-11-08 17:42:38,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76
[2024-11-08 17:42:38,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76
[2024-11-08 17:42:38,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 112 transitions.
[2024-11-08 17:42:38,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:38,885 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 112 transitions.
[2024-11-08 17:42:38,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 112 transitions.
[2024-11-08 17:42:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73.
[2024-11-08 17:42:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 62 states have internal predecessors, (79), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8)
[2024-11-08 17:42:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions.
[2024-11-08 17:42:38,892 INFO L240 hiAutomatonCegarLoop]: Abstraction has 73 states and 94 transitions.
[2024-11-08 17:42:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 17:42:38,894 INFO L425 stractBuchiCegarLoop]: Abstraction has 73 states and 94 transitions.
[2024-11-08 17:42:38,894 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============
[2024-11-08 17:42:38,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 94 transitions.
[2024-11-08 17:42:38,895 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24
[2024-11-08 17:42:38,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:38,896 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:38,897 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:38,897 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:38,898 INFO L745 eck$LassoCheckResult]: Stem: 1092#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1063#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1064#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 1068#L40-3 assume main_~i~1#1 < main_~n~0#1; 1069#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1070#L40-3 assume main_~i~1#1 < main_~n~0#1; 1071#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1107#L40-3 assume main_~i~1#1 < main_~n~0#1; 1104#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1103#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1101#L40-4 havoc main_~i~1#1; 1056#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1098#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1083#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1054#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1080#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1084#L24 assume ~n#1 < 2; 1117#merge_sortFINAL assume true; 1109#merge_sortEXIT >#85#return; 1057#L27-1
[2024-11-08 17:42:38,898 INFO L747 eck$LassoCheckResult]: Loop: 1057#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1081#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1082#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1055#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1081#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1082#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1055#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1081#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1082#L24 assume ~n#1 < 2; 1113#merge_sortFINAL assume true; 1114#merge_sortEXIT >#85#return; 1057#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1081#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1082#L24 assume ~n#1 < 2; 1113#merge_sortFINAL assume true; 1114#merge_sortEXIT >#87#return; 1111#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 1085#L11-3 assume merge_~k~0#1 < merge_~n#1; 1086#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 1106#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 1093#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 1094#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 1097#L11-4 merge_~i~0#1 := 0; 1096#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 1053#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 1058#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 1067#merge_sortFINAL assume true; 1110#merge_sortEXIT >#85#return; 1057#L27-1
[2024-11-08 17:42:38,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash 913462406, now seen corresponding path program 3 times
[2024-11-08 17:42:38,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:38,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385967686]
[2024-11-08 17:42:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:38,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:38,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:38,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:38,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:38,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1176878165, now seen corresponding path program 1 times
[2024-11-08 17:42:38,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:38,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400450330]
[2024-11-08 17:42:38,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:38,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:39,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-08 17:42:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:39,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:42:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:39,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:42:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2024-11-08 17:42:39,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:42:39,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400450330]
[2024-11-08 17:42:39,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400450330] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:42:39,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830238644]
[2024-11-08 17:42:39,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:39,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:42:39,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:39,328 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:42:39,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process
[2024-11-08 17:42:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:39,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:39,439 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-11-08 17:42:39,544 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:42:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-11-08 17:42:39,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830238644] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:42:39,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:42:39,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16
[2024-11-08 17:42:39,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940873861]
[2024-11-08 17:42:39,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:42:39,746 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 17:42:39,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:42:39,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-08 17:42:39,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240
[2024-11-08 17:42:39,747 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. cyclomatic complexity: 28 Second operand has 16 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 7 states have call successors, (8)
[2024-11-08 17:42:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:42:40,155 INFO L93 Difference]: Finished difference Result 129 states and 174 transitions.
[2024-11-08 17:42:40,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 174 transitions.
[2024-11-08 17:42:40,158 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 71
[2024-11-08 17:42:40,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 129 states and 174 transitions.
[2024-11-08 17:42:40,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120
[2024-11-08 17:42:40,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120
[2024-11-08 17:42:40,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 174 transitions.
[2024-11-08 17:42:40,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:40,162 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 174 transitions.
[2024-11-08 17:42:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 174 transitions.
[2024-11-08 17:42:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 85.
[2024-11-08 17:42:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 74 states have internal predecessors, (95), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8)
[2024-11-08 17:42:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions.
[2024-11-08 17:42:40,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 85 states and 110 transitions.
[2024-11-08 17:42:40,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-08 17:42:40,173 INFO L425 stractBuchiCegarLoop]: Abstraction has 85 states and 110 transitions.
[2024-11-08 17:42:40,174 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============
[2024-11-08 17:42:40,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 110 transitions.
[2024-11-08 17:42:40,175 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 36
[2024-11-08 17:42:40,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:40,175 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:40,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:40,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:40,177 INFO L745 eck$LassoCheckResult]: Stem: 1519#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1489#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1490#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 1496#L40-3 assume main_~i~1#1 < main_~n~0#1; 1497#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1498#L40-3 assume main_~i~1#1 < main_~n~0#1; 1499#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1518#L40-3 assume main_~i~1#1 < main_~n~0#1; 1527#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1526#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1524#L40-4 havoc main_~i~1#1; 1482#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1523#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1512#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1479#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1508#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1513#L24 assume ~n#1 < 2; 1538#merge_sortFINAL assume true; 1535#merge_sortEXIT >#85#return; 1480#L27-1
[2024-11-08 17:42:40,177 INFO L747 eck$LassoCheckResult]: Loop: 1480#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1531#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1528#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1481#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1531#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1528#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1481#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1531#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1528#L24 assume ~n#1 < 2; 1529#merge_sortFINAL assume true; 1537#merge_sortEXIT >#85#return; 1480#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1531#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1528#L24 assume ~n#1 < 2; 1529#merge_sortFINAL assume true; 1537#merge_sortEXIT >#87#return; 1500#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 1501#L11-3 assume merge_~k~0#1 < merge_~n#1; 1491#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 1492#L12 assume !(merge_~j~0#1 == merge_~n#1); 1486#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 1487#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 1557#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 1559#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 1514#L11-4 merge_~i~0#1 := 0; 1515#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 1484#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 1485#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 1495#merge_sortFINAL assume true; 1536#merge_sortEXIT >#85#return; 1480#L27-1
[2024-11-08 17:42:40,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash 913462406, now seen corresponding path program 4 times
[2024-11-08 17:42:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:40,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687787717]
[2024-11-08 17:42:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:40,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:40,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:40,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:40,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1594232674, now seen corresponding path program 1 times
[2024-11-08 17:42:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:40,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569615702]
[2024-11-08 17:42:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:40,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:40,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-08 17:42:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:40,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:42:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:40,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:42:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-11-08 17:42:40,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:42:40,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569615702]
[2024-11-08 17:42:40,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569615702] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:42:40,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:42:40,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 17:42:40,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488024157]
[2024-11-08 17:42:40,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:42:40,564 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 17:42:40,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:42:40,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 17:42:40,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:42:40,565 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. cyclomatic complexity: 32 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2024-11-08 17:42:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:42:40,672 INFO L93 Difference]: Finished difference Result 103 states and 136 transitions.
[2024-11-08 17:42:40,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 136 transitions.
[2024-11-08 17:42:40,675 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 49
[2024-11-08 17:42:40,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 136 transitions.
[2024-11-08 17:42:40,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94
[2024-11-08 17:42:40,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94
[2024-11-08 17:42:40,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 136 transitions.
[2024-11-08 17:42:40,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:40,684 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 136 transitions.
[2024-11-08 17:42:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 136 transitions.
[2024-11-08 17:42:40,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99.
[2024-11-08 17:42:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 88 states have internal predecessors, (115), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8)
[2024-11-08 17:42:40,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions.
[2024-11-08 17:42:40,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 99 states and 130 transitions.
[2024-11-08 17:42:40,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 17:42:40,705 INFO L425 stractBuchiCegarLoop]: Abstraction has 99 states and 130 transitions.
[2024-11-08 17:42:40,708 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============
[2024-11-08 17:42:40,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 130 transitions.
[2024-11-08 17:42:40,710 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48
[2024-11-08 17:42:40,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:40,710 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:40,712 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:40,712 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:40,712 INFO L745 eck$LassoCheckResult]: Stem: 1751#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1721#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1722#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 1728#L40-3 assume main_~i~1#1 < main_~n~0#1; 1729#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1730#L40-3 assume main_~i~1#1 < main_~n~0#1; 1731#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1764#L40-3 assume main_~i~1#1 < main_~n~0#1; 1763#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 1762#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1760#L40-4 havoc main_~i~1#1; 1712#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1759#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1745#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1713#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1741#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1746#L24 assume ~n#1 < 2; 1778#merge_sortFINAL assume true; 1773#merge_sortEXIT >#85#return; 1714#L27-1
[2024-11-08 17:42:40,713 INFO L747 eck$LassoCheckResult]: Loop: 1714#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1777#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1771#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1715#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1777#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1771#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 1715#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1777#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1771#L24 assume ~n#1 < 2; 1772#merge_sortFINAL assume true; 1774#merge_sortEXIT >#85#return; 1714#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1777#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1771#L24 assume ~n#1 < 2; 1772#merge_sortFINAL assume true; 1774#merge_sortEXIT >#87#return; 1775#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 1747#L11-3 assume merge_~k~0#1 < merge_~n#1; 1723#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 1724#L12 assume !(merge_~j~0#1 == merge_~n#1); 1719#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 1720#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 1742#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 1804#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 1803#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 1802#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 1758#L11-4 merge_~i~0#1 := 0; 1757#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 1717#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 1718#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 1727#merge_sortFINAL assume true; 1776#merge_sortEXIT >#85#return; 1714#L27-1
[2024-11-08 17:42:40,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:40,713 INFO L85 PathProgramCache]: Analyzing trace with hash 913462406, now seen corresponding path program 5 times
[2024-11-08 17:42:40,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:40,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808375682]
[2024-11-08 17:42:40,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:40,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:40,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:40,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:40,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:40,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1074757124, now seen corresponding path program 1 times
[2024-11-08 17:42:40,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:40,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072846308]
[2024-11-08 17:42:40,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:40,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:40,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-08 17:42:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:41,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:42:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:41,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:42:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-08 17:42:41,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:42:41,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072846308]
[2024-11-08 17:42:41,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072846308] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:42:41,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496943485]
[2024-11-08 17:42:41,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:41,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:42:41,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:41,090 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:42:41,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process
[2024-11-08 17:42:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:41,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:41,207 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2024-11-08 17:42:41,318 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:42:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2024-11-08 17:42:41,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496943485] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:42:41,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:42:41,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12
[2024-11-08 17:42:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242023612]
[2024-11-08 17:42:41,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:42:41,429 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 17:42:41,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:42:41,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-08 17:42:41,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132
[2024-11-08 17:42:41,432 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. cyclomatic complexity: 38 Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2024-11-08 17:42:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:42:41,849 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions.
[2024-11-08 17:42:41,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 224 transitions.
[2024-11-08 17:42:41,852 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 65
[2024-11-08 17:42:41,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 181 states and 224 transitions.
[2024-11-08 17:42:41,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172
[2024-11-08 17:42:41,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172
[2024-11-08 17:42:41,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 224 transitions.
[2024-11-08 17:42:41,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:41,856 INFO L218 hiAutomatonCegarLoop]: Abstraction has 181 states and 224 transitions.
[2024-11-08 17:42:41,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 224 transitions.
[2024-11-08 17:42:41,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 121.
[2024-11-08 17:42:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 109 states have (on average 1.2201834862385321) internal successors, (133), 110 states have internal predecessors, (133), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8)
[2024-11-08 17:42:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions.
[2024-11-08 17:42:41,865 INFO L240 hiAutomatonCegarLoop]: Abstraction has 121 states and 148 transitions.
[2024-11-08 17:42:41,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-11-08 17:42:41,867 INFO L425 stractBuchiCegarLoop]: Abstraction has 121 states and 148 transitions.
[2024-11-08 17:42:41,867 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============
[2024-11-08 17:42:41,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 148 transitions.
[2024-11-08 17:42:41,869 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 48
[2024-11-08 17:42:41,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:41,869 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:41,870 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:41,870 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:41,870 INFO L745 eck$LassoCheckResult]: Stem: 2292#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2260#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2261#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 2265#L40-3 assume main_~i~1#1 < main_~n~0#1; 2266#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2267#L40-3 assume main_~i~1#1 < main_~n~0#1; 2268#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2301#L40-3 assume main_~i~1#1 < main_~n~0#1; 2302#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2304#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 2290#L40-4 havoc main_~i~1#1; 2250#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2298#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2283#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2251#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2278#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2284#L24 assume ~n#1 < 2; 2315#merge_sortFINAL assume true; 2273#merge_sortEXIT >#85#return; 2249#L27-1
[2024-11-08 17:42:41,871 INFO L747 eck$LassoCheckResult]: Loop: 2249#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2311#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2305#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2252#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2311#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2305#L24 assume ~n#1 < 2; 2274#merge_sortFINAL assume true; 2275#merge_sortEXIT >#85#return; 2249#L27-1
[2024-11-08 17:42:41,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:41,871 INFO L85 PathProgramCache]: Analyzing trace with hash 913462406, now seen corresponding path program 6 times
[2024-11-08 17:42:41,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:41,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161105044]
[2024-11-08 17:42:41,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:41,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:41,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:41,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:41,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:41,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2057523910, now seen corresponding path program 2 times
[2024-11-08 17:42:41,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:41,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217348856]
[2024-11-08 17:42:41,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:41,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:41,908 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:41,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:41,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:41,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1513575233, now seen corresponding path program 2 times
[2024-11-08 17:42:41,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:41,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588227958]
[2024-11-08 17:42:41,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:41,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:41,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:41,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:43,779 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 17:42:43,780 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 17:42:43,780 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 17:42:43,780 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 17:42:43,780 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 17:42:43,780 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:43,780 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 17:42:43,780 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 17:42:43,780 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration10_Lasso
[2024-11-08 17:42:43,781 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 17:42:43,781 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 17:42:43,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:43,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,089 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:44,654 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 17:42:44,655 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 17:42:44,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:44,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:44,659 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:44,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process
[2024-11-08 17:42:44,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:44,679 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:44,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:44,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:44,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:44,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:44,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:44,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:44,686 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:44,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0
[2024-11-08 17:42:44,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:44,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:44,713 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:44,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process
[2024-11-08 17:42:44,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:44,735 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:44,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:44,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:44,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:44,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:44,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:44,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:44,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:44,763 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:44,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:44,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:44,765 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:44,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process
[2024-11-08 17:42:44,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:44,824 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:44,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:44,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:44,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:44,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:44,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:44,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:44,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:44,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:44,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:44,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:44,854 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:44,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process
[2024-11-08 17:42:44,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:44,874 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:44,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:44,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:44,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:44,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:44,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:44,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:44,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:44,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0
[2024-11-08 17:42:44,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:44,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:44,903 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:44,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process
[2024-11-08 17:42:44,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:44,925 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:44,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:44,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:44,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:44,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:44,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:44,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:44,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:44,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:44,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:44,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:44,954 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:44,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process
[2024-11-08 17:42:44,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
[2024-11-08 17:42:44,973 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:44,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:44,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:44,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:44,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:44,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:44,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:44,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:44,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0
[2024-11-08 17:42:44,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:44,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:44,998 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:45,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:45,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process
[2024-11-08 17:42:45,013 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:45,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:45,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:45,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:45,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:45,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:45,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:45,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:45,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0
[2024-11-08 17:42:45,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:45,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:45,032 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:45,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process
[2024-11-08 17:42:45,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:45,048 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:45,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:45,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:45,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:45,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:45,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:45,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:45,051 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:45,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0
[2024-11-08 17:42:45,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:45,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:45,068 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:45,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process
[2024-11-08 17:42:45,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:45,083 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:45,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:45,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:45,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:45,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:45,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:45,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:45,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:45,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:45,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:45,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:45,102 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:45,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process
[2024-11-08 17:42:45,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:45,118 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:45,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:45,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:45,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:45,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:45,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:45,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:45,121 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:45,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0
[2024-11-08 17:42:45,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:45,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:45,136 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:45,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process
[2024-11-08 17:42:45,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:45,152 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:45,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:45,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:45,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:45,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:45,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:45,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:45,155 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:45,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:45,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:45,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:45,171 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:45,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process
[2024-11-08 17:42:45,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:45,186 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:45,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:45,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:45,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:45,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:45,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:45,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:45,189 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:45,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0
[2024-11-08 17:42:45,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:45,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:45,205 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:45,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process
[2024-11-08 17:42:45,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:45,228 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:45,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:45,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:45,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:45,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:45,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:45,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:45,234 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:45,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0
[2024-11-08 17:42:45,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:45,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:45,259 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:45,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process
[2024-11-08 17:42:45,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:45,282 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:45,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:45,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:45,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:45,298 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:42:45,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:42:45,317 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 17:42:45,344 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver.
[2024-11-08 17:42:45,345 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 6 variables to zero.
[2024-11-08 17:42:45,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:45,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:45,347 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:45,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process
[2024-11-08 17:42:45,350 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 17:42:45,375 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2.
[2024-11-08 17:42:45,375 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 17:42:45,376 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_~n#1) = 1*merge_sort_~n#1
Supporting invariants [2*merge_sort_~m~0#1 - 1 >= 0, 4*merge_sort_~n#1 - 1 >= 0]
[2024-11-08 17:42:45,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0
[2024-11-08 17:42:45,423 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed
[2024-11-08 17:42:45,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:45,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:45,509 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:45,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:45,793 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:42:45,934 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 5 loop predicates
[2024-11-08 17:42:45,934 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 148 transitions. cyclomatic complexity: 34 Second operand has 14 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-08 17:42:46,643 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 148 transitions. cyclomatic complexity: 34. Second operand has 14 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 377 states and 483 transitions. Complement of second has 46 states.
[2024-11-08 17:42:46,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 11 stem states 4 non-accepting loop states 1 accepting loop states
[2024-11-08 17:42:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-08 17:42:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions.
[2024-11-08 17:42:46,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 65 transitions. Stem has 19 letters. Loop has 8 letters.
[2024-11-08 17:42:46,647 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:42:46,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 65 transitions. Stem has 27 letters. Loop has 8 letters.
[2024-11-08 17:42:46,648 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:42:46,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 65 transitions. Stem has 19 letters. Loop has 16 letters.
[2024-11-08 17:42:46,649 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:42:46,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 377 states and 483 transitions.
[2024-11-08 17:42:46,657 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 96
[2024-11-08 17:42:46,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 377 states to 362 states and 467 transitions.
[2024-11-08 17:42:46,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 239
[2024-11-08 17:42:46,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242
[2024-11-08 17:42:46,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 362 states and 467 transitions.
[2024-11-08 17:42:46,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:46,665 INFO L218 hiAutomatonCegarLoop]: Abstraction has 362 states and 467 transitions.
[2024-11-08 17:42:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states and 467 transitions.
[2024-11-08 17:42:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 323.
[2024-11-08 17:42:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 293 states have (on average 1.2320819112627985) internal successors, (361), 294 states have internal predecessors, (361), 19 states have call successors, (21), 13 states have call predecessors, (21), 11 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22)
[2024-11-08 17:42:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 404 transitions.
[2024-11-08 17:42:46,685 INFO L240 hiAutomatonCegarLoop]: Abstraction has 323 states and 404 transitions.
[2024-11-08 17:42:46,685 INFO L425 stractBuchiCegarLoop]: Abstraction has 323 states and 404 transitions.
[2024-11-08 17:42:46,685 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============
[2024-11-08 17:42:46,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 323 states and 404 transitions.
[2024-11-08 17:42:46,688 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 96
[2024-11-08 17:42:46,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:46,689 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:46,689 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:46,689 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-08 17:42:46,690 INFO L745 eck$LassoCheckResult]: Stem: 3012#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2957#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2958#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 2965#L40-3 assume main_~i~1#1 < main_~n~0#1; 2966#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 2967#L40-3 assume main_~i~1#1 < main_~n~0#1; 2968#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3026#L40-3 assume main_~i~1#1 < main_~n~0#1; 3007#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3008#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 3044#L40-4 havoc main_~i~1#1; 2985#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 3042#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3002#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2983#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2984#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3043#L24 assume ~n#1 < 2; 3087#merge_sortFINAL assume true; 3086#merge_sortEXIT >#85#return; 2977#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2993#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2994#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2943#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3035#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3152#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2937#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2982#$Ultimate##0
[2024-11-08 17:42:46,690 INFO L747 eck$LassoCheckResult]: Loop: 2982#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3148#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 2938#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2982#$Ultimate##0
[2024-11-08 17:42:46,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:46,691 INFO L85 PathProgramCache]: Analyzing trace with hash 228269712, now seen corresponding path program 3 times
[2024-11-08 17:42:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:46,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306925190]
[2024-11-08 17:42:46,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:46,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:47,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:47,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2024-11-08 17:42:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:42:47,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:42:47,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306925190]
[2024-11-08 17:42:47,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306925190] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:42:47,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142597288]
[2024-11-08 17:42:47,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-08 17:42:47,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:42:47,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:47,273 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:42:47,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process
[2024-11-08 17:42:47,400 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2024-11-08 17:42:47,400 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:42:47,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:47,407 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-08 17:42:47,542 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:42:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-08 17:42:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142597288] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:42:47,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:42:47,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 22
[2024-11-08 17:42:47,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756656004]
[2024-11-08 17:42:47,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:42:47,779 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:42:47,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash 29999, now seen corresponding path program 4 times
[2024-11-08 17:42:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:47,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850730053]
[2024-11-08 17:42:47,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:47,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:47,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:47,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:48,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:42:48,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-11-08 17:42:48,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462
[2024-11-08 17:42:48,018 INFO L87 Difference]: Start difference. First operand 323 states and 404 transitions. cyclomatic complexity: 99 Second operand has 22 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 17 states have internal predecessors, (34), 9 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 17:42:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:42:48,863 INFO L93 Difference]: Finished difference Result 255 states and 321 transitions.
[2024-11-08 17:42:48,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 255 states and 321 transitions.
[2024-11-08 17:42:48,868 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 92
[2024-11-08 17:42:48,871 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 255 states to 247 states and 313 transitions.
[2024-11-08 17:42:48,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 229
[2024-11-08 17:42:48,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 235
[2024-11-08 17:42:48,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 313 transitions.
[2024-11-08 17:42:48,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:48,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 247 states and 313 transitions.
[2024-11-08 17:42:48,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 313 transitions.
[2024-11-08 17:42:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 244.
[2024-11-08 17:42:48,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 217 states have (on average 1.2211981566820276) internal successors, (265), 217 states have internal predecessors, (265), 17 states have call successors, (18), 15 states have call predecessors, (18), 10 states have return successors, (27), 11 states have call predecessors, (27), 14 states have call successors, (27)
[2024-11-08 17:42:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 310 transitions.
[2024-11-08 17:42:48,904 INFO L240 hiAutomatonCegarLoop]: Abstraction has 244 states and 310 transitions.
[2024-11-08 17:42:48,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2024-11-08 17:42:48,905 INFO L425 stractBuchiCegarLoop]: Abstraction has 244 states and 310 transitions.
[2024-11-08 17:42:48,906 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============
[2024-11-08 17:42:48,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 244 states and 310 transitions.
[2024-11-08 17:42:48,908 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 92
[2024-11-08 17:42:48,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:48,912 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:48,913 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:48,913 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:48,913 INFO L745 eck$LassoCheckResult]: Stem: 3778#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3734#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 3735#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 3743#L40-3 assume main_~i~1#1 < main_~n~0#1; 3744#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3745#L40-3 assume main_~i~1#1 < main_~n~0#1; 3746#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 3786#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 3775#L40-4 havoc main_~i~1#1; 3737#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 3841#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3839#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 3835#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3836#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3840#L24 assume ~n#1 < 2; 3838#merge_sortFINAL assume true; 3834#merge_sortEXIT >#85#return; 3831#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 3832#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3837#L24 assume ~n#1 < 2; 3833#merge_sortFINAL assume true; 3830#merge_sortEXIT >#87#return; 3829#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 3828#L11-3 assume merge_~k~0#1 < merge_~n#1; 3827#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 3826#L12 assume !(merge_~j~0#1 == merge_~n#1); 3825#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 3822#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 3819#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 3817#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 3815#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 3813#L11-3 assume merge_~k~0#1 < merge_~n#1; 3809#L11-1
[2024-11-08 17:42:48,913 INFO L747 eck$LassoCheckResult]: Loop: 3809#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 3810#L12 assume !(merge_~j~0#1 == merge_~n#1); 3824#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 3820#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 3821#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 3849#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 3799#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 3800#L11-3 assume merge_~k~0#1 < merge_~n#1; 3809#L11-1
[2024-11-08 17:42:48,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:48,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1704135146, now seen corresponding path program 1 times
[2024-11-08 17:42:48,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:48,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537224067]
[2024-11-08 17:42:48,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:48,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:48,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:48,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:48,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1757394127, now seen corresponding path program 1 times
[2024-11-08 17:42:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:48,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619577101]
[2024-11-08 17:42:48,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:48,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:48,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:48,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:48,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:48,997 INFO L85 PathProgramCache]: Analyzing trace with hash 335764506, now seen corresponding path program 2 times
[2024-11-08 17:42:48,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:48,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792832463]
[2024-11-08 17:42:48,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:48,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:49,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-08 17:42:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:49,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 17:42:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 17:42:49,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:42:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792832463]
[2024-11-08 17:42:49,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792832463] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:42:49,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582380063]
[2024-11-08 17:42:49,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 17:42:49,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:42:49,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:49,354 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:42:49,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process
[2024-11-08 17:42:49,479 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 17:42:49,479 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:42:49,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:49,483 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 17:42:49,678 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:42:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 17:42:49,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582380063] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:42:49,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:42:49,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16
[2024-11-08 17:42:49,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781654038]
[2024-11-08 17:42:49,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:42:50,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:42:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-11-08 17:42:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272
[2024-11-08 17:42:50,139 INFO L87 Difference]: Start difference. First operand 244 states and 310 transitions. cyclomatic complexity: 77 Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 15 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-08 17:42:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:42:50,527 INFO L93 Difference]: Finished difference Result 242 states and 304 transitions.
[2024-11-08 17:42:50,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 304 transitions.
[2024-11-08 17:42:50,532 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 72
[2024-11-08 17:42:50,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 242 states and 304 transitions.
[2024-11-08 17:42:50,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 231
[2024-11-08 17:42:50,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231
[2024-11-08 17:42:50,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 242 states and 304 transitions.
[2024-11-08 17:42:50,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:50,537 INFO L218 hiAutomatonCegarLoop]: Abstraction has 242 states and 304 transitions.
[2024-11-08 17:42:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states and 304 transitions.
[2024-11-08 17:42:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 235.
[2024-11-08 17:42:50,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 208 states have (on average 1.2115384615384615) internal successors, (252), 208 states have internal predecessors, (252), 17 states have call successors, (18), 15 states have call predecessors, (18), 10 states have return successors, (27), 11 states have call predecessors, (27), 14 states have call successors, (27)
[2024-11-08 17:42:50,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 297 transitions.
[2024-11-08 17:42:50,547 INFO L240 hiAutomatonCegarLoop]: Abstraction has 235 states and 297 transitions.
[2024-11-08 17:42:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-08 17:42:50,549 INFO L425 stractBuchiCegarLoop]: Abstraction has 235 states and 297 transitions.
[2024-11-08 17:42:50,549 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============
[2024-11-08 17:42:50,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 235 states and 297 transitions.
[2024-11-08 17:42:50,552 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 72
[2024-11-08 17:42:50,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:50,552 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:50,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:50,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:50,554 INFO L745 eck$LassoCheckResult]: Stem: 4533#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4493#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4494#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 4501#L40-3 assume main_~i~1#1 < main_~n~0#1; 4502#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4503#L40-3 assume main_~i~1#1 < main_~n~0#1; 4504#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4544#L40-3 assume main_~i~1#1 < main_~n~0#1; 4543#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 4542#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 4531#L40-4 havoc main_~i~1#1; 4480#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 4481#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4598#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 4593#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4599#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4520#L24 assume ~n#1 < 2; 4592#merge_sortFINAL assume true; 4594#merge_sortEXIT >#85#return; 4523#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 4601#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4615#L24 assume ~n#1 < 2; 4610#merge_sortFINAL assume true; 4590#merge_sortEXIT >#87#return; 4591#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 4662#L11-3 assume merge_~k~0#1 < merge_~n#1; 4661#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 4660#L12 assume !(merge_~j~0#1 == merge_~n#1); 4659#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 4656#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 4653#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 4651#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 4649#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 4647#L11-3 assume merge_~k~0#1 < merge_~n#1; 4643#L11-1
[2024-11-08 17:42:50,554 INFO L747 eck$LassoCheckResult]: Loop: 4643#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 4644#L12 assume !(merge_~j~0#1 == merge_~n#1); 4658#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 4654#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 4655#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 4667#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 4637#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 4638#L11-3 assume merge_~k~0#1 < merge_~n#1; 4643#L11-1
[2024-11-08 17:42:50,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:50,554 INFO L85 PathProgramCache]: Analyzing trace with hash 568942309, now seen corresponding path program 3 times
[2024-11-08 17:42:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:50,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432045056]
[2024-11-08 17:42:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:50,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2024-11-08 17:42:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-08 17:42:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-08 17:42:50,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:42:50,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432045056]
[2024-11-08 17:42:50,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432045056] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:42:50,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920981593]
[2024-11-08 17:42:50,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-08 17:42:50,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:42:50,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:50,857 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:42:50,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process
[2024-11-08 17:42:51,028 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2024-11-08 17:42:51,029 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:42:51,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:51,033 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-08 17:42:51,159 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:42:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-08 17:42:51,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920981593] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:42:51,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:42:51,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 16
[2024-11-08 17:42:51,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703445111]
[2024-11-08 17:42:51,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:42:51,385 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:42:51,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:51,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1757394127, now seen corresponding path program 2 times
[2024-11-08 17:42:51,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:51,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684168218]
[2024-11-08 17:42:51,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:51,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:51,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:51,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:51,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:42:51,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2024-11-08 17:42:51,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240
[2024-11-08 17:42:51,736 INFO L87 Difference]: Start difference. First operand 235 states and 297 transitions. cyclomatic complexity: 72 Second operand has 16 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 states have internal predecessors, (34), 4 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-08 17:42:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:42:52,285 INFO L93 Difference]: Finished difference Result 332 states and 424 transitions.
[2024-11-08 17:42:52,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 332 states and 424 transitions.
[2024-11-08 17:42:52,290 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 116
[2024-11-08 17:42:52,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 332 states to 317 states and 404 transitions.
[2024-11-08 17:42:52,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304
[2024-11-08 17:42:52,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304
[2024-11-08 17:42:52,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 404 transitions.
[2024-11-08 17:42:52,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:52,295 INFO L218 hiAutomatonCegarLoop]: Abstraction has 317 states and 404 transitions.
[2024-11-08 17:42:52,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 404 transitions.
[2024-11-08 17:42:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 273.
[2024-11-08 17:42:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 242 states have (on average 1.2107438016528926) internal successors, (293), 242 states have internal predecessors, (293), 21 states have call successors, (22), 15 states have call predecessors, (22), 10 states have return successors, (37), 15 states have call predecessors, (37), 18 states have call successors, (37)
[2024-11-08 17:42:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 352 transitions.
[2024-11-08 17:42:52,306 INFO L240 hiAutomatonCegarLoop]: Abstraction has 273 states and 352 transitions.
[2024-11-08 17:42:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2024-11-08 17:42:52,307 INFO L425 stractBuchiCegarLoop]: Abstraction has 273 states and 352 transitions.
[2024-11-08 17:42:52,307 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============
[2024-11-08 17:42:52,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 273 states and 352 transitions.
[2024-11-08 17:42:52,310 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 92
[2024-11-08 17:42:52,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:52,310 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:52,311 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:52,311 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:42:52,311 INFO L745 eck$LassoCheckResult]: Stem: 5347#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5309#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 5310#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 5318#L40-3 assume main_~i~1#1 < main_~n~0#1; 5319#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5320#L40-3 assume main_~i~1#1 < main_~n~0#1; 5321#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 5355#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 5356#L40-4 havoc main_~i~1#1; 5290#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 5291#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5368#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 5369#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 5441#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5443#L24 assume ~n#1 < 2; 5392#merge_sortFINAL assume true; 5393#merge_sortEXIT >#85#return; 5335#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 5334#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5336#L24 assume ~n#1 < 2; 5340#merge_sortFINAL assume true; 5370#merge_sortEXIT >#87#return; 5371#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 5543#L11-3 assume merge_~k~0#1 < merge_~n#1; 5542#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 5541#L12 assume !(merge_~j~0#1 == merge_~n#1); 5540#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 5538#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 5537#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 5536#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 5535#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 5534#L11-3 assume merge_~k~0#1 < merge_~n#1; 5533#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 5530#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 5531#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 5372#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 5342#L11-4 merge_~i~0#1 := 0; 5312#L17-3
[2024-11-08 17:42:52,312 INFO L747 eck$LassoCheckResult]: Loop: 5312#L17-3 assume merge_~i~0#1 < merge_~n#1; 5311#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 5312#L17-3
[2024-11-08 17:42:52,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:52,312 INFO L85 PathProgramCache]: Analyzing trace with hash 170083130, now seen corresponding path program 1 times
[2024-11-08 17:42:52,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059786651]
[2024-11-08 17:42:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:52,338 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:52,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:52,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 1 times
[2024-11-08 17:42:52,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:52,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538711446]
[2024-11-08 17:42:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:52,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:52,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:52,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:52,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:52,372 INFO L85 PathProgramCache]: Analyzing trace with hash 241132127, now seen corresponding path program 1 times
[2024-11-08 17:42:52,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:52,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039936299]
[2024-11-08 17:42:52,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:52,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:52,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:55,489 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 17:42:55,489 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 17:42:55,489 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 17:42:55,490 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 17:42:55,490 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 17:42:55,490 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:55,490 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 17:42:55,490 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 17:42:55,490 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration14_Lasso
[2024-11-08 17:42:55,491 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 17:42:55,491 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 17:42:55,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:55,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:55,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:55,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:55,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:55,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:55,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:55,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:56,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:42:57,282 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 17:42:57,282 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 17:42:57,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,285 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:57,303 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:57,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:57,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:57,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:57,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:57,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:57,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:57,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:57,321 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:57,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,324 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:57,338 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:57,339 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:57,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:57,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:57,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:57,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:57,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:57,341 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:57,354 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0
[2024-11-08 17:42:57,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,356 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:57,370 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:57,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:57,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:57,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:57,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:57,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:57,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:57,372 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:57,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:57,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,386 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:57,400 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:57,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:57,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:57,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:57,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:57,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:57,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:57,403 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:57,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0
[2024-11-08 17:42:57,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,419 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:57,434 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:57,434 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:57,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:57,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:57,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:57,435 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:57,435 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:57,436 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:57,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0
[2024-11-08 17:42:57,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,451 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:57,467 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:57,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:57,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:57,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:57,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:57,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:57,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:57,470 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:57,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:57,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,485 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:57,501 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:57,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:57,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:57,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:57,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:57,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:57,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:57,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:57,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:57,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,518 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,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
[2024-11-08 17:42:57,532 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:57,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:57,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:57,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:57,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:57,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:57,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:57,536 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:57,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0
[2024-11-08 17:42:57,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,554 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:57,568 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:57,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:42:57,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:57,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:57,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:57,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:42:57,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:42:57,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:57,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0
[2024-11-08 17:42:57,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,586 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:57,606 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:57,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:57,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:57,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:57,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:42:57,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:42:57,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:57,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0
[2024-11-08 17:42:57,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,640 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:57,659 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:57,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:57,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:57,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:57,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:42:57,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:42:57,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:57,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:57,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,687 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:57,707 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:57,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:57,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:57,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:57,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:42:57,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:42:57,740 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:42:57,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:57,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,764 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:42:57,786 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:42:57,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:42:57,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:42:57,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:42:57,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:42:57,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:42:57,825 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 17:42:57,919 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver.
[2024-11-08 17:42:57,919 INFO L444 ModelExtractionUtils]: 9 out of 37 variables were initially zero. Simplification set additionally 24 variables to zero.
[2024-11-08 17:42:57,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:42:57,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:57,922 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:42:57,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process
[2024-11-08 17:42:57,925 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 17:42:57,943 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2.
[2024-11-08 17:42:57,943 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 17:42:57,944 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_merge_~i~0#1, v_rep(select #length merge_sort_merge_~x~0#1.base)_1) = -2*merge_sort_merge_~i~0#1 + 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_1
Supporting invariants [1*merge_sort_merge_~x~0#1.offset >= 0]
[2024-11-08 17:42:57,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0
[2024-11-08 17:42:58,021 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed
[2024-11-08 17:42:58,024 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length
[2024-11-08 17:42:58,024 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
[2024-11-08 17:42:58,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:58,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:58,130 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:58,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:58,400 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:42:58,412 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates
[2024-11-08 17:42:58,413 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 273 states and 352 transitions. cyclomatic complexity: 90 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-08 17:42:58,537 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 273 states and 352 transitions. cyclomatic complexity: 90. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 320 states and 410 transitions. Complement of second has 12 states.
[2024-11-08 17:42:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-08 17:42:58,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-08 17:42:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions.
[2024-11-08 17:42:58,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 37 letters. Loop has 2 letters.
[2024-11-08 17:42:58,540 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:42:58,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 39 letters. Loop has 2 letters.
[2024-11-08 17:42:58,541 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:42:58,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 37 letters. Loop has 4 letters.
[2024-11-08 17:42:58,542 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:42:58,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 410 transitions.
[2024-11-08 17:42:58,546 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 112
[2024-11-08 17:42:58,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 275 states and 359 transitions.
[2024-11-08 17:42:58,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 257
[2024-11-08 17:42:58,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 259
[2024-11-08 17:42:58,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 359 transitions.
[2024-11-08 17:42:58,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:42:58,555 INFO L218 hiAutomatonCegarLoop]: Abstraction has 275 states and 359 transitions.
[2024-11-08 17:42:58,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 359 transitions.
[2024-11-08 17:42:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273.
[2024-11-08 17:42:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 247 states have (on average 1.2267206477732793) internal successors, (303), 246 states have internal predecessors, (303), 18 states have call successors, (19), 12 states have call predecessors, (19), 8 states have return successors, (35), 14 states have call predecessors, (35), 16 states have call successors, (35)
[2024-11-08 17:42:58,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 357 transitions.
[2024-11-08 17:42:58,566 INFO L240 hiAutomatonCegarLoop]: Abstraction has 273 states and 357 transitions.
[2024-11-08 17:42:58,567 INFO L425 stractBuchiCegarLoop]: Abstraction has 273 states and 357 transitions.
[2024-11-08 17:42:58,567 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============
[2024-11-08 17:42:58,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 273 states and 357 transitions.
[2024-11-08 17:42:58,570 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 112
[2024-11-08 17:42:58,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:42:58,570 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:42:58,572 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:58,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:42:58,573 INFO L745 eck$LassoCheckResult]: Stem: 6148#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6103#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 6104#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 6115#L40-3 assume main_~i~1#1 < main_~n~0#1; 6116#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6117#L40-3 assume main_~i~1#1 < main_~n~0#1; 6118#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6162#L40-3 assume main_~i~1#1 < main_~n~0#1; 6161#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6155#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 6146#L40-4 havoc main_~i~1#1; 6088#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 6089#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6209#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 6203#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6207#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6134#L24 assume ~n#1 < 2; 6206#merge_sortFINAL assume true; 6202#merge_sortEXIT >#85#return; 6111#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 6211#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6210#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 6201#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6204#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6208#L24 assume ~n#1 < 2; 6205#merge_sortFINAL assume true; 6200#merge_sortEXIT >#85#return; 6191#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 6192#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6214#L24 assume ~n#1 < 2; 6213#merge_sortFINAL assume true; 6190#merge_sortEXIT >#87#return; 6189#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 6188#L11-3 assume merge_~k~0#1 < merge_~n#1; 6187#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 6186#L12 assume !(merge_~j~0#1 == merge_~n#1); 6185#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 6182#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 6179#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 6177#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6175#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 6173#L11-3 assume merge_~k~0#1 < merge_~n#1; 6169#L11-1
[2024-11-08 17:42:58,573 INFO L747 eck$LassoCheckResult]: Loop: 6169#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 6170#L12 assume !(merge_~j~0#1 == merge_~n#1); 6184#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 6180#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 6181#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 6193#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6163#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 6164#L11-3 assume merge_~k~0#1 < merge_~n#1; 6169#L11-1
[2024-11-08 17:42:58,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:58,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1181586036, now seen corresponding path program 4 times
[2024-11-08 17:42:58,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:58,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912638481]
[2024-11-08 17:42:58,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:58,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:58,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:58,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:58,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1757394127, now seen corresponding path program 3 times
[2024-11-08 17:42:58,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:58,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540844841]
[2024-11-08 17:42:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:58,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:58,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:42:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:42:58,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:42:58,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:42:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1128136124, now seen corresponding path program 5 times
[2024-11-08 17:42:58,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:42:58,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118976085]
[2024-11-08 17:42:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:42:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:42:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:58,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0
[2024-11-08 17:42:59,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2024-11-08 17:42:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22
[2024-11-08 17:42:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:59,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2024-11-08 17:42:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:42:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-08 17:42:59,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:42:59,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118976085]
[2024-11-08 17:42:59,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118976085] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:42:59,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773839887]
[2024-11-08 17:42:59,300 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-08 17:42:59,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:42:59,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:42:59,303 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:42:59,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process
[2024-11-08 17:42:59,459 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s)
[2024-11-08 17:42:59,460 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:42:59,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-08 17:42:59,464 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:42:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2024-11-08 17:42:59,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:42:59,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773839887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:42:59,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 17:42:59,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21
[2024-11-08 17:42:59,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997827836]
[2024-11-08 17:42:59,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:42:59,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:42:59,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 17:42:59,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462
[2024-11-08 17:42:59,970 INFO L87 Difference]: Start difference. First operand 273 states and 357 transitions. cyclomatic complexity: 97 Second operand has 9 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3)
[2024-11-08 17:43:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:43:00,104 INFO L93 Difference]: Finished difference Result 270 states and 346 transitions.
[2024-11-08 17:43:00,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 346 transitions.
[2024-11-08 17:43:00,108 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 72
[2024-11-08 17:43:00,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 346 transitions.
[2024-11-08 17:43:00,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 255
[2024-11-08 17:43:00,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 255
[2024-11-08 17:43:00,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 346 transitions.
[2024-11-08 17:43:00,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:43:00,114 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 346 transitions.
[2024-11-08 17:43:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 346 transitions.
[2024-11-08 17:43:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 255.
[2024-11-08 17:43:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 229 states have (on average 1.2096069868995634) internal successors, (277), 228 states have internal predecessors, (277), 18 states have call successors, (19), 12 states have call predecessors, (19), 8 states have return successors, (35), 14 states have call predecessors, (35), 16 states have call successors, (35)
[2024-11-08 17:43:00,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 331 transitions.
[2024-11-08 17:43:00,125 INFO L240 hiAutomatonCegarLoop]: Abstraction has 255 states and 331 transitions.
[2024-11-08 17:43:00,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 17:43:00,126 INFO L425 stractBuchiCegarLoop]: Abstraction has 255 states and 331 transitions.
[2024-11-08 17:43:00,126 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============
[2024-11-08 17:43:00,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 331 transitions.
[2024-11-08 17:43:00,128 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 72
[2024-11-08 17:43:00,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:43:00,128 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:43:00,131 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:43:00,131 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:43:00,131 INFO L745 eck$LassoCheckResult]: Stem: 6889#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6839#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 6840#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 6850#L40-3 assume main_~i~1#1 < main_~n~0#1; 6851#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6852#L40-3 assume main_~i~1#1 < main_~n~0#1; 6853#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6901#L40-3 assume main_~i~1#1 < main_~n~0#1; 6900#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 6894#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 6885#L40-4 havoc main_~i~1#1; 6822#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 6823#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6938#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 6931#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6936#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6869#L24 assume ~n#1 < 2; 6935#merge_sortFINAL assume true; 6930#merge_sortEXIT >#85#return; 6846#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 6942#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6940#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 6933#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 6934#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6939#L24 assume ~n#1 < 2; 6937#merge_sortFINAL assume true; 6932#merge_sortEXIT >#85#return; 6926#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 6927#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 6948#L24 assume ~n#1 < 2; 6928#merge_sortFINAL assume true; 6929#merge_sortEXIT >#87#return; 6924#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 6923#L11-3 assume merge_~k~0#1 < merge_~n#1; 6922#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 6921#L12 assume !(merge_~j~0#1 == merge_~n#1); 6920#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 6918#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 6917#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 6916#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6915#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 6914#L11-3 assume merge_~k~0#1 < merge_~n#1; 6913#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 6909#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 6905#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 6893#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 6892#L11-4 merge_~i~0#1 := 0; 6891#L17-3 assume merge_~i~0#1 < merge_~n#1; 6844#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 6847#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 6875#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 6958#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 6957#merge_sortFINAL assume true; 6857#merge_sortEXIT >#87#return; 6860#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 7011#L11-3 assume merge_~k~0#1 < merge_~n#1; 7010#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 7009#L12 assume !(merge_~j~0#1 == merge_~n#1); 7008#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 7005#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 7002#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 7000#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6998#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 6996#L11-3 assume merge_~k~0#1 < merge_~n#1; 6992#L11-1
[2024-11-08 17:43:00,134 INFO L747 eck$LassoCheckResult]: Loop: 6992#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 6993#L12 assume !(merge_~j~0#1 == merge_~n#1); 7007#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 7003#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 7004#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 7019#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6949#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 6950#L11-3 assume merge_~k~0#1 < merge_~n#1; 6992#L11-1
[2024-11-08 17:43:00,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:00,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1651549611, now seen corresponding path program 1 times
[2024-11-08 17:43:00,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:43:00,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111077533]
[2024-11-08 17:43:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:43:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:00,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2024-11-08 17:43:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:00,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-08 17:43:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:00,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:43:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:00,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:43:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2024-11-08 17:43:00,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:43:00,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111077533]
[2024-11-08 17:43:00,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111077533] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:43:00,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684832371]
[2024-11-08 17:43:00,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:00,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:43:00,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:00,544 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:43:00,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process
[2024-11-08 17:43:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:00,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-08 17:43:00,727 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:43:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2024-11-08 17:43:01,011 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:43:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 25 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2024-11-08 17:43:01,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684832371] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:43:01,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:43:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 14] total 25
[2024-11-08 17:43:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493501610]
[2024-11-08 17:43:01,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:43:01,550 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:43:01,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:01,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1757394127, now seen corresponding path program 4 times
[2024-11-08 17:43:01,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:43:01,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103050923]
[2024-11-08 17:43:01,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:01,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:43:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:01,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:43:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:01,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:43:01,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:43:01,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-11-08 17:43:01,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600
[2024-11-08 17:43:01,904 INFO L87 Difference]: Start difference. First operand 255 states and 331 transitions. cyclomatic complexity: 87 Second operand has 25 states, 23 states have (on average 4.0) internal successors, (92), 21 states have internal predecessors, (92), 7 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11)
[2024-11-08 17:43:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:43:03,531 INFO L93 Difference]: Finished difference Result 404 states and 515 transitions.
[2024-11-08 17:43:03,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 515 transitions.
[2024-11-08 17:43:03,537 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 152
[2024-11-08 17:43:03,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 402 states and 513 transitions.
[2024-11-08 17:43:03,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 384
[2024-11-08 17:43:03,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 384
[2024-11-08 17:43:03,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 402 states and 513 transitions.
[2024-11-08 17:43:03,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:43:03,544 INFO L218 hiAutomatonCegarLoop]: Abstraction has 402 states and 513 transitions.
[2024-11-08 17:43:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states and 513 transitions.
[2024-11-08 17:43:03,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259.
[2024-11-08 17:43:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 233 states have (on average 1.1888412017167382) internal successors, (277), 232 states have internal predecessors, (277), 18 states have call successors, (19), 12 states have call predecessors, (19), 8 states have return successors, (35), 14 states have call predecessors, (35), 16 states have call successors, (35)
[2024-11-08 17:43:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 331 transitions.
[2024-11-08 17:43:03,555 INFO L240 hiAutomatonCegarLoop]: Abstraction has 259 states and 331 transitions.
[2024-11-08 17:43:03,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states.
[2024-11-08 17:43:03,556 INFO L425 stractBuchiCegarLoop]: Abstraction has 259 states and 331 transitions.
[2024-11-08 17:43:03,557 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============
[2024-11-08 17:43:03,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 331 transitions.
[2024-11-08 17:43:03,559 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 72
[2024-11-08 17:43:03,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:43:03,560 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:43:03,561 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:43:03,561 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:43:03,561 INFO L745 eck$LassoCheckResult]: Stem: 8056#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 8013#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 8014#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 8024#L40-3 assume main_~i~1#1 < main_~n~0#1; 8025#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8026#L40-3 assume main_~i~1#1 < main_~n~0#1; 8027#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8065#L40-3 assume main_~i~1#1 < main_~n~0#1; 8064#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 8060#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 8054#L40-4 havoc main_~i~1#1; 7997#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 7998#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8104#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 8097#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 8102#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8045#L24 assume ~n#1 < 2; 8101#merge_sortFINAL assume true; 8096#merge_sortEXIT >#85#return; 8021#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 8105#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8103#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 8095#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 8098#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8100#L24 assume ~n#1 < 2; 8099#merge_sortFINAL assume true; 8094#merge_sortEXIT >#85#return; 8090#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 8091#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 8109#L24 assume ~n#1 < 2; 8107#merge_sortFINAL assume true; 8089#merge_sortEXIT >#87#return; 8088#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 8087#L11-3 assume merge_~k~0#1 < merge_~n#1; 8086#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 8085#L12 assume !(merge_~j~0#1 == merge_~n#1); 8084#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 8082#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 8081#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 8080#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 8079#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 8078#L11-3 assume merge_~k~0#1 < merge_~n#1; 8077#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 8074#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 8073#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 8072#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 8068#L11-4 merge_~i~0#1 := 0; 8066#L17-3 assume merge_~i~0#1 < merge_~n#1; 8067#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 8049#L17-3 assume merge_~i~0#1 < merge_~n#1; 8019#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 8022#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 8069#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 8126#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 8125#merge_sortFINAL assume true; 8032#merge_sortEXIT >#87#return; 8035#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 8219#L11-3 assume merge_~k~0#1 < merge_~n#1; 8220#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 8215#L12 assume !(merge_~j~0#1 == merge_~n#1); 8216#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 8211#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 8212#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 8249#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 8248#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 8047#L11-3 assume merge_~k~0#1 < merge_~n#1; 8015#L11-1
[2024-11-08 17:43:03,562 INFO L747 eck$LassoCheckResult]: Loop: 8015#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 8016#L12 assume !(merge_~j~0#1 == merge_~n#1); 8011#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 8012#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 7999#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 8001#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 8057#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 8058#L11-3 assume merge_~k~0#1 < merge_~n#1; 8015#L11-1
[2024-11-08 17:43:03,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:03,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1880954022, now seen corresponding path program 2 times
[2024-11-08 17:43:03,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:43:03,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486620329]
[2024-11-08 17:43:03,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:03,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:43:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:03,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:43:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:03,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:43:03,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:03,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1757394127, now seen corresponding path program 5 times
[2024-11-08 17:43:03,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:43:03,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164747417]
[2024-11-08 17:43:03,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:03,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:43:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:03,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:43:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:03,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:43:03,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:03,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2094732586, now seen corresponding path program 3 times
[2024-11-08 17:43:03,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:43:03,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406726893]
[2024-11-08 17:43:03,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:03,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:43:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:03,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:43:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:03,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:43:19,580 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 17:43:19,580 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 17:43:19,580 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 17:43:19,580 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 17:43:19,580 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 17:43:19,580 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:19,580 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 17:43:19,580 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 17:43:19,580 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration17_Lasso
[2024-11-08 17:43:19,581 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 17:43:19,581 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 17:43:19,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:19,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:22,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:22,510 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:22,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:22,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:22,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:22,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:43:23,821 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 17:43:23,821 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 17:43:23,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:23,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:23,830 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:23,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process
[2024-11-08 17:43:23,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:23,853 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:23,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:23,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:23,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:23,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:23,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:23,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:23,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:23,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0
[2024-11-08 17:43:23,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:23,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:23,879 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:23,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process
[2024-11-08 17:43:23,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
[2024-11-08 17:43:23,895 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:23,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:23,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:23,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:23,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:23,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:23,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:23,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:23,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0
[2024-11-08 17:43:23,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:23,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:23,910 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:23,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process
[2024-11-08 17:43:23,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:23,923 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:23,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:23,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:23,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:23,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:23,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:23,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:23,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:23,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0
[2024-11-08 17:43:23,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:23,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:23,938 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:23,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process
[2024-11-08 17:43:23,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:23,950 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:23,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:23,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:23,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:23,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:23,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:23,951 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:23,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:23,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0
[2024-11-08 17:43:23,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:23,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:23,967 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:23,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process
[2024-11-08 17:43:23,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:23,979 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:23,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:23,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:23,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:23,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:23,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:23,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:23,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:23,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0
[2024-11-08 17:43:23,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:23,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:23,996 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:23,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process
[2024-11-08 17:43:23,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,008 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0
[2024-11-08 17:43:24,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,023 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,036 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,038 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0
[2024-11-08 17:43:24,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,052 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,067 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,068 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,068 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0
[2024-11-08 17:43:24,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,084 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,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
[2024-11-08 17:43:24,098 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0
[2024-11-08 17:43:24,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,113 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,125 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,127 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0
[2024-11-08 17:43:24,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,140 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,152 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,156 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0
[2024-11-08 17:43:24,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,173 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,186 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0
[2024-11-08 17:43:24,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,201 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,215 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,217 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0
[2024-11-08 17:43:24,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,229 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,242 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0
[2024-11-08 17:43:24,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,257 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,269 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0
[2024-11-08 17:43:24,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,284 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,297 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0
[2024-11-08 17:43:24,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,311 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,323 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0
[2024-11-08 17:43:24,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,338 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,350 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0
[2024-11-08 17:43:24,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,366 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,378 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,381 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0
[2024-11-08 17:43:24,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,394 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,407 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0
[2024-11-08 17:43:24,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,423 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,436 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0
[2024-11-08 17:43:24,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,451 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,484 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,486 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0
[2024-11-08 17:43:24,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,499 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,513 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,515 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0
[2024-11-08 17:43:24,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,528 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,540 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0
[2024-11-08 17:43:24,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,555 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,568 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,572 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0
[2024-11-08 17:43:24,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,587 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,600 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:43:24,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:43:24,604 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,615 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0
[2024-11-08 17:43:24,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,616 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,632 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:43:24,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:43:24,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:43:24,634 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0
[2024-11-08 17:43:24,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,648 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,661 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:43:24,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:43:24,668 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0
[2024-11-08 17:43:24,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,682 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:43:24,695 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:43:24,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:43:24,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:43:24,712 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:43:24,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0
[2024-11-08 17:43:24,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:24,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:24,725 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:24,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process
[2024-11-08 17:43:24,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
[2024-11-08 17:43:24,737 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:43:24,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:43:24,738 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts
[2024-11-08 17:43:24,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:43:24,830 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications.
[2024-11-08 17:43:24,830 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added.
[2024-11-08 17:43:25,264 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 17:43:27,154 INFO L443 ModelExtractionUtils]: Simplification made 81 calls to the SMT solver.
[2024-11-08 17:43:27,154 INFO L444 ModelExtractionUtils]: 28 out of 118 variables were initially zero. Simplification set additionally 83 variables to zero.
[2024-11-08 17:43:27,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:43:27,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:27,156 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:43:27,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process
[2024-11-08 17:43:27,158 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 17:43:27,175 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 8.
[2024-11-08 17:43:27,176 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 17:43:27,176 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_merge_~j~0#1, merge_sort_merge_~n#1) = -1*merge_sort_merge_~j~0#1 + 6*merge_sort_merge_~n#1
Supporting invariants [-1*merge_sort_merge_~j~0#1 + 6*merge_sort_merge_~k~0#1 >= 0, -1*v_rep(select #length merge_sort_#in~a#1.base)_4 + 12*merge_sort_merge_~k~0#1 >= 0]
[2024-11-08 17:43:27,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0
[2024-11-08 17:43:27,621 INFO L156 tatePredicateManager]: 39 out of 42 supporting invariants were superfluous and have been removed
[2024-11-08 17:43:27,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:27,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 124 conjuncts are in the unsatisfiable core
[2024-11-08 17:43:27,775 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:43:27,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-11-08 17:43:27,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9
[2024-11-08 17:43:28,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0
[2024-11-08 17:43:30,142 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-08 17:43:30,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9
[2024-11-08 17:43:30,158 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-08 17:43:30,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11
[2024-11-08 17:43:30,223 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-11-08 17:43:30,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14
[2024-11-08 17:43:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:30,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 17:43:30,471 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:43:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:43:30,802 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.23 stem predicates 4 loop predicates
[2024-11-08 17:43:30,802 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 331 transitions. cyclomatic complexity: 83 Second operand has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:43:32,102 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 331 transitions. cyclomatic complexity: 83. Second operand has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Result 271 states and 345 transitions. Complement of second has 29 states.
[2024-11-08 17:43:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 17 stem states 0 non-accepting loop states 1 accepting loop states
[2024-11-08 17:43:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:43:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 38 transitions.
[2024-11-08 17:43:32,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 38 transitions. Stem has 66 letters. Loop has 8 letters.
[2024-11-08 17:43:32,105 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:43:32,105 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 17:43:32,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:32,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 120 conjuncts are in the unsatisfiable core
[2024-11-08 17:43:32,318 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:43:32,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-11-08 17:43:32,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9
[2024-11-08 17:43:34,303 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-08 17:43:34,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9
[2024-11-08 17:43:34,316 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-08 17:43:34,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11
[2024-11-08 17:43:34,407 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-11-08 17:43:34,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14
[2024-11-08 17:43:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:34,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 17:43:34,604 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:43:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:43:34,866 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.20 stem predicates 4 loop predicates
[2024-11-08 17:43:34,867 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 331 transitions. cyclomatic complexity: 83 Second operand has 25 states, 24 states have (on average 2.375) internal successors, (57), 23 states have internal predecessors, (57), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:43:35,817 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 331 transitions. cyclomatic complexity: 83. Second operand has 25 states, 24 states have (on average 2.375) internal successors, (57), 23 states have internal predecessors, (57), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Result 271 states and 345 transitions. Complement of second has 24 states.
[2024-11-08 17:43:35,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 14 stem states 0 non-accepting loop states 1 accepting loop states
[2024-11-08 17:43:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 2.375) internal successors, (57), 23 states have internal predecessors, (57), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:43:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 36 transitions.
[2024-11-08 17:43:35,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 36 transitions. Stem has 66 letters. Loop has 8 letters.
[2024-11-08 17:43:35,824 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:43:35,824 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 17:43:35,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:35,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 124 conjuncts are in the unsatisfiable core
[2024-11-08 17:43:35,973 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:43:35,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9
[2024-11-08 17:43:35,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-11-08 17:43:37,942 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-08 17:43:37,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9
[2024-11-08 17:43:37,954 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-08 17:43:37,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11
[2024-11-08 17:43:38,015 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-11-08 17:43:38,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14
[2024-11-08 17:43:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:38,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 17:43:38,206 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:43:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:43:38,466 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.23 stem predicates 4 loop predicates
[2024-11-08 17:43:38,467 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 331 transitions. cyclomatic complexity: 83 Second operand has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:43:40,970 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 331 transitions. cyclomatic complexity: 83. Second operand has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Result 995 states and 1269 transitions. Complement of second has 77 states.
[2024-11-08 17:43:40,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 30 states 23 stem states 4 non-accepting loop states 2 accepting loop states
[2024-11-08 17:43:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 25 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:43:40,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 182 transitions.
[2024-11-08 17:43:40,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 182 transitions. Stem has 66 letters. Loop has 8 letters.
[2024-11-08 17:43:40,975 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:43:40,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 182 transitions. Stem has 74 letters. Loop has 8 letters.
[2024-11-08 17:43:40,975 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:43:40,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 182 transitions. Stem has 66 letters. Loop has 16 letters.
[2024-11-08 17:43:40,976 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:43:40,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 995 states and 1269 transitions.
[2024-11-08 17:43:40,988 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 140
[2024-11-08 17:43:40,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 995 states to 537 states and 665 transitions.
[2024-11-08 17:43:40,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 445
[2024-11-08 17:43:40,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482
[2024-11-08 17:43:40,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 537 states and 665 transitions.
[2024-11-08 17:43:40,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:43:40,996 INFO L218 hiAutomatonCegarLoop]: Abstraction has 537 states and 665 transitions.
[2024-11-08 17:43:40,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states and 665 transitions.
[2024-11-08 17:43:41,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 432.
[2024-11-08 17:43:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 395 states have (on average 1.1873417721518988) internal successors, (469), 394 states have internal predecessors, (469), 25 states have call successors, (26), 14 states have call predecessors, (26), 12 states have return successors, (41), 23 states have call predecessors, (41), 23 states have call successors, (41)
[2024-11-08 17:43:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 536 transitions.
[2024-11-08 17:43:41,010 INFO L240 hiAutomatonCegarLoop]: Abstraction has 432 states and 536 transitions.
[2024-11-08 17:43:41,010 INFO L425 stractBuchiCegarLoop]: Abstraction has 432 states and 536 transitions.
[2024-11-08 17:43:41,010 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============
[2024-11-08 17:43:41,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 432 states and 536 transitions.
[2024-11-08 17:43:41,014 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 110
[2024-11-08 17:43:41,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:43:41,014 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:43:41,015 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:43:41,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:43:41,016 INFO L745 eck$LassoCheckResult]: Stem: 11012#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10958#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 10959#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 10969#L40-3 assume main_~i~1#1 < main_~n~0#1; 10970#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 10971#L40-3 assume main_~i~1#1 < main_~n~0#1; 10972#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 11023#L40-3 assume main_~i~1#1 < main_~n~0#1; 11022#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 11021#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 11007#L40-4 havoc main_~i~1#1; 10935#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 10936#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 11049#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 11046#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 11047#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 11054#L24 assume ~n#1 < 2; 11053#merge_sortFINAL assume true; 11045#merge_sortEXIT >#85#return; 11042#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 11043#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 11086#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 11083#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 11084#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 11089#L24 assume ~n#1 < 2; 11087#merge_sortFINAL assume true; 11081#merge_sortEXIT >#85#return; 11076#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 11079#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 11085#L24 assume ~n#1 < 2; 11080#merge_sortFINAL assume true; 11075#merge_sortEXIT >#87#return; 11074#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 11073#L11-3 assume merge_~k~0#1 < merge_~n#1; 11072#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 11071#L12 assume !(merge_~j~0#1 == merge_~n#1); 11070#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 11068#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 11067#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 11066#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 11065#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 11064#L11-3 assume merge_~k~0#1 < merge_~n#1; 11063#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 11061#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 11060#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 11059#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 11058#L11-4 merge_~i~0#1 := 0; 11057#L17-3 assume merge_~i~0#1 < merge_~n#1; 11056#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 11055#L17-3 assume merge_~i~0#1 < merge_~n#1; 11052#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 11051#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 11050#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 11048#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 11044#merge_sortFINAL assume true; 11041#merge_sortEXIT >#87#return; 11040#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 11039#L11-3 assume merge_~k~0#1 < merge_~n#1; 11038#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 11037#L12 assume !(merge_~j~0#1 == merge_~n#1); 11036#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 11034#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 11035#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 11108#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 11107#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 11105#L11-3 assume merge_~k~0#1 < merge_~n#1; 11103#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 10955#L12
[2024-11-08 17:43:41,016 INFO L747 eck$LassoCheckResult]: Loop: 10955#L12 assume !(merge_~j~0#1 == merge_~n#1); 11347#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 10951#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 11348#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 11356#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 11357#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 11353#L11-3 assume merge_~k~0#1 < merge_~n#1; 10954#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 10955#L12
[2024-11-08 17:43:41,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1762709144, now seen corresponding path program 1 times
[2024-11-08 17:43:41,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:43:41,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284293409]
[2024-11-08 17:43:41,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:41,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:43:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:41,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:43:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:41,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:43:41,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:41,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1343825393, now seen corresponding path program 1 times
[2024-11-08 17:43:41,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:43:41,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584729099]
[2024-11-08 17:43:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:41,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:43:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:41,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:43:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:41,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:43:41,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1466059658, now seen corresponding path program 2 times
[2024-11-08 17:43:41,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:43:41,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961838746]
[2024-11-08 17:43:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:41,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:43:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:41,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2024-11-08 17:43:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:41,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-08 17:43:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:41,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:43:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:41,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:43:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2024-11-08 17:43:41,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:43:41,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961838746]
[2024-11-08 17:43:41,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961838746] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:43:41,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967200617]
[2024-11-08 17:43:41,790 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 17:43:41,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:43:41,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:41,792 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:43:41,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process
[2024-11-08 17:43:42,005 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 17:43:42,005 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:43:42,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 32 conjuncts are in the unsatisfiable core
[2024-11-08 17:43:42,011 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:43:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 47 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2024-11-08 17:43:42,422 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:43:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 22 proven. 50 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2024-11-08 17:43:43,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967200617] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:43:43,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:43:43,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 40
[2024-11-08 17:43:43,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908338567]
[2024-11-08 17:43:43,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:43:43,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:43:43,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2024-11-08 17:43:43,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1425, Unknown=0, NotChecked=0, Total=1560
[2024-11-08 17:43:43,785 INFO L87 Difference]: Start difference. First operand 432 states and 536 transitions. cyclomatic complexity: 121 Second operand has 40 states, 35 states have (on average 3.4857142857142858) internal successors, (122), 29 states have internal predecessors, (122), 14 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12)
[2024-11-08 17:43:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:43:45,668 INFO L93 Difference]: Finished difference Result 775 states and 956 transitions.
[2024-11-08 17:43:45,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 775 states and 956 transitions.
[2024-11-08 17:43:45,675 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 256
[2024-11-08 17:43:45,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 775 states to 775 states and 956 transitions.
[2024-11-08 17:43:45,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 704
[2024-11-08 17:43:45,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 704
[2024-11-08 17:43:45,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 775 states and 956 transitions.
[2024-11-08 17:43:45,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:43:45,684 INFO L218 hiAutomatonCegarLoop]: Abstraction has 775 states and 956 transitions.
[2024-11-08 17:43:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states and 956 transitions.
[2024-11-08 17:43:45,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 575.
[2024-11-08 17:43:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 538 states have (on average 1.1895910780669146) internal successors, (640), 534 states have internal predecessors, (640), 25 states have call successors, (26), 14 states have call predecessors, (26), 12 states have return successors, (41), 26 states have call predecessors, (41), 23 states have call successors, (41)
[2024-11-08 17:43:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 707 transitions.
[2024-11-08 17:43:45,710 INFO L240 hiAutomatonCegarLoop]: Abstraction has 575 states and 707 transitions.
[2024-11-08 17:43:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2024-11-08 17:43:45,712 INFO L425 stractBuchiCegarLoop]: Abstraction has 575 states and 707 transitions.
[2024-11-08 17:43:45,712 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============
[2024-11-08 17:43:45,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 575 states and 707 transitions.
[2024-11-08 17:43:45,718 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 162
[2024-11-08 17:43:45,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:43:45,718 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:43:45,724 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:43:45,724 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:43:45,725 INFO L745 eck$LassoCheckResult]: Stem: 12812#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12757#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 12758#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 12771#L40-3 assume main_~i~1#1 < main_~n~0#1; 12772#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 12773#L40-3 assume main_~i~1#1 < main_~n~0#1; 12774#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 12822#L40-3 assume main_~i~1#1 < main_~n~0#1; 12821#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 12820#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 12808#L40-4 havoc main_~i~1#1; 12735#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 12736#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12852#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 12848#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 12849#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12854#L24 assume ~n#1 < 2; 12851#merge_sortFINAL assume true; 12847#merge_sortEXIT >#85#return; 12844#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 12845#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12894#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 12891#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 12892#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12898#L24 assume ~n#1 < 2; 12897#merge_sortFINAL assume true; 12889#merge_sortEXIT >#85#return; 12884#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 12887#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12896#L24 assume ~n#1 < 2; 12888#merge_sortFINAL assume true; 12883#merge_sortEXIT >#87#return; 12882#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 12881#L11-3 assume merge_~k~0#1 < merge_~n#1; 12880#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 12879#L12 assume !(merge_~j~0#1 == merge_~n#1); 12878#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 12875#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 12873#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 12871#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 12869#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 12867#L11-3 assume merge_~k~0#1 < merge_~n#1; 12865#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 12863#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 12862#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 12861#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 12860#L11-4 merge_~i~0#1 := 0; 12859#L17-3 assume merge_~i~0#1 < merge_~n#1; 12858#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 12857#L17-3 assume merge_~i~0#1 < merge_~n#1; 12856#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 12855#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 12853#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 12850#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 12846#merge_sortFINAL assume true; 12843#merge_sortEXIT >#87#return; 12842#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 12841#L11-3 assume merge_~k~0#1 < merge_~n#1; 12840#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 12839#L12 assume !(merge_~j~0#1 == merge_~n#1); 12838#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 12836#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 12835#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 12834#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 12833#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 12832#L11-3 assume merge_~k~0#1 < merge_~n#1; 12827#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 12829#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 13188#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 13257#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 12805#L11-4 merge_~i~0#1 := 0; 12761#L17-3
[2024-11-08 17:43:45,725 INFO L747 eck$LassoCheckResult]: Loop: 12761#L17-3 assume merge_~i~0#1 < merge_~n#1; 12759#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 12761#L17-3
[2024-11-08 17:43:45,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1461620222, now seen corresponding path program 4 times
[2024-11-08 17:43:45,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:43:45,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056167896]
[2024-11-08 17:43:45,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:45,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:43:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:45,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2024-11-08 17:43:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:45,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-08 17:43:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:46,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:43:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:46,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:43:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:43:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked.
[2024-11-08 17:43:46,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:43:46,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056167896]
[2024-11-08 17:43:46,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056167896] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:43:46,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139655574]
[2024-11-08 17:43:46,083 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-08 17:43:46,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:43:46,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:43:46,085 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:43:46,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process
[2024-11-08 17:43:46,392 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-08 17:43:46,392 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:43:46,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 12 conjuncts are in the unsatisfiable core
[2024-11-08 17:43:46,397 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:43:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 31 proven. 21 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2024-11-08 17:43:46,607 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:43:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 31 proven. 21 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2024-11-08 17:43:46,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139655574] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:43:46,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:43:46,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 21
[2024-11-08 17:43:46,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530299276]
[2024-11-08 17:43:46,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:43:46,811 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:43:46,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 2 times
[2024-11-08 17:43:46,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:43:46,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225745855]
[2024-11-08 17:43:46,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:46,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:43:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:46,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:43:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:46,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:43:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:43:46,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2024-11-08 17:43:46,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420
[2024-11-08 17:43:46,911 INFO L87 Difference]: Start difference. First operand 575 states and 707 transitions. cyclomatic complexity: 154 Second operand has 21 states, 21 states have (on average 4.904761904761905) internal successors, (103), 18 states have internal predecessors, (103), 4 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-08 17:43:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:43:48,139 INFO L93 Difference]: Finished difference Result 906 states and 1091 transitions.
[2024-11-08 17:43:48,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 906 states and 1091 transitions.
[2024-11-08 17:43:48,151 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 224
[2024-11-08 17:43:48,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 906 states to 897 states and 1082 transitions.
[2024-11-08 17:43:48,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 800
[2024-11-08 17:43:48,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 800
[2024-11-08 17:43:48,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 897 states and 1082 transitions.
[2024-11-08 17:43:48,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:43:48,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 897 states and 1082 transitions.
[2024-11-08 17:43:48,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states and 1082 transitions.
[2024-11-08 17:43:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 698.
[2024-11-08 17:43:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 661 states have (on average 1.1800302571860817) internal successors, (780), 654 states have internal predecessors, (780), 25 states have call successors, (26), 16 states have call predecessors, (26), 12 states have return successors, (41), 27 states have call predecessors, (41), 23 states have call successors, (41)
[2024-11-08 17:43:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 847 transitions.
[2024-11-08 17:43:48,191 INFO L240 hiAutomatonCegarLoop]: Abstraction has 698 states and 847 transitions.
[2024-11-08 17:43:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states.
[2024-11-08 17:43:48,192 INFO L425 stractBuchiCegarLoop]: Abstraction has 698 states and 847 transitions.
[2024-11-08 17:43:48,192 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============
[2024-11-08 17:43:48,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 698 states and 847 transitions.
[2024-11-08 17:43:48,197 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 186
[2024-11-08 17:43:48,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:43:48,197 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:43:48,198 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:43:48,199 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:43:48,199 INFO L745 eck$LassoCheckResult]: Stem: 14856#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 14806#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 14807#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 14817#L40-3 assume main_~i~1#1 < main_~n~0#1; 14818#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 14819#L40-3 assume main_~i~1#1 < main_~n~0#1; 14820#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 14867#L40-3 assume main_~i~1#1 < main_~n~0#1; 14866#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 14865#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 14853#L40-4 havoc main_~i~1#1; 14782#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 14783#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14941#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 14938#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 14939#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14942#L24 assume ~n#1 < 2; 14940#merge_sortFINAL assume true; 14937#merge_sortEXIT >#85#return; 14871#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 14960#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14968#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 14927#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 14929#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14931#L24 assume ~n#1 < 2; 14930#merge_sortFINAL assume true; 14925#merge_sortEXIT >#85#return; 14922#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 14920#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 14924#L24 assume ~n#1 < 2; 14921#merge_sortFINAL assume true; 14923#merge_sortEXIT >#87#return; 14915#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 14916#L11-3 assume merge_~k~0#1 < merge_~n#1; 14911#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 14912#L12 assume !(merge_~j~0#1 == merge_~n#1); 14905#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 14906#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 14896#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 14897#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 14888#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 14889#L11-3 assume merge_~k~0#1 < merge_~n#1; 14880#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 14881#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 14875#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 14876#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 14870#L11-4 merge_~i~0#1 := 0; 14872#L17-3 assume merge_~i~0#1 < merge_~n#1; 14967#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 14966#L17-3 assume merge_~i~0#1 < merge_~n#1; 14965#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 14964#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 14963#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 14962#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 14961#merge_sortFINAL assume true; 14959#merge_sortEXIT >#87#return; 14958#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 14957#L11-3 assume merge_~k~0#1 < merge_~n#1; 14956#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 14955#L12 assume !(merge_~j~0#1 == merge_~n#1); 14954#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 14952#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 14953#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 14978#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 14977#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 14976#L11-3 assume merge_~k~0#1 < merge_~n#1; 14974#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 14822#L12 assume !(merge_~j~0#1 == merge_~n#1); 14823#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 14837#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 14787#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 14788#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 14973#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 14972#L11-3 assume merge_~k~0#1 < merge_~n#1; 14803#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 14805#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 15406#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 15432#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 14850#L11-4 merge_~i~0#1 := 0; 14809#L17-3
[2024-11-08 17:43:48,199 INFO L747 eck$LassoCheckResult]: Loop: 14809#L17-3 assume merge_~i~0#1 < merge_~n#1; 14808#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 14809#L17-3
[2024-11-08 17:43:48,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1888152114, now seen corresponding path program 5 times
[2024-11-08 17:43:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:43:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504442296]
[2024-11-08 17:43:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:48,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:43:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:48,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:43:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:48,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:43:48,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:48,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2406, now seen corresponding path program 3 times
[2024-11-08 17:43:48,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:43:48,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300481309]
[2024-11-08 17:43:48,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:48,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:43:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:48,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:43:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:48,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:43:48,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:43:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2037981197, now seen corresponding path program 6 times
[2024-11-08 17:43:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:43:48,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99804974]
[2024-11-08 17:43:48,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:43:48,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:43:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:48,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:43:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:43:48,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:00,774 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 17:44:00,774 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 17:44:00,774 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 17:44:00,774 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 17:44:00,774 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 17:44:00,775 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:00,775 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 17:44:00,775 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 17:44:00,775 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration20_Lasso
[2024-11-08 17:44:00,775 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 17:44:00,775 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 17:44:00,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:00,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:00,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:00,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:00,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:00,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:00,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:00,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:00,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:00,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:00,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:00,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:01,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:03,076 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 17:44:03,076 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 17:44:03,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,080 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,093 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:03,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:03,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:03,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0
[2024-11-08 17:44:03,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,108 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,121 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:44:03,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:44:03,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0
[2024-11-08 17:44:03,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,140 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,156 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:44:03,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:44:03,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0
[2024-11-08 17:44:03,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,178 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,190 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:03,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:03,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:03,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0
[2024-11-08 17:44:03,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,206 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,219 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:03,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:03,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:03,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0
[2024-11-08 17:44:03,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,234 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,246 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:03,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:03,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:03,248 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0
[2024-11-08 17:44:03,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,262 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,274 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:03,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:03,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:03,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0
[2024-11-08 17:44:03,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,290 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,303 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:03,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:03,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:03,305 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0
[2024-11-08 17:44:03,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,317 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,330 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:03,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:03,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:03,332 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0
[2024-11-08 17:44:03,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,345 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,358 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:03,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:03,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:03,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0
[2024-11-08 17:44:03,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,375 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,387 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:03,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:03,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:03,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0
[2024-11-08 17:44:03,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,403 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,415 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:03,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:03,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:03,418 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0
[2024-11-08 17:44:03,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,431 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,443 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,445 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:44:03,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:44:03,449 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0
[2024-11-08 17:44:03,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,461 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,473 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:44:03,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:44:03,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0
[2024-11-08 17:44:03,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,492 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,504 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:03,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:03,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:03,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0
[2024-11-08 17:44:03,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,519 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,532 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:44:03,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:44:03,540 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0
[2024-11-08 17:44:03,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,559 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,573 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,573 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts
[2024-11-08 17:44:03,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,581 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications.
[2024-11-08 17:44:03,581 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:44:03,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:03,606 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0
[2024-11-08 17:44:03,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,608 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:03,621 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:03,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:03,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:03,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:03,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:44:03,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:44:03,644 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 17:44:03,683 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver.
[2024-11-08 17:44:03,684 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero.
[2024-11-08 17:44:03,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:03,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:03,686 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:03,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process
[2024-11-08 17:44:03,688 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 17:44:03,707 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-11-08 17:44:03,707 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 17:44:03,707 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_merge_~i~0#1, v_rep(select #length merge_sort_#in~a#1.base)_5) = -2*merge_sort_merge_~i~0#1 + 1*v_rep(select #length merge_sort_#in~a#1.base)_5
Supporting invariants []
[2024-11-08 17:44:03,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0
[2024-11-08 17:44:03,811 INFO L156 tatePredicateManager]: 17 out of 20 supporting invariants were superfluous and have been removed
[2024-11-08 17:44:03,817 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length
[2024-11-08 17:44:03,817 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL]
[2024-11-08 17:44:03,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:03,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 38 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:03,977 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:04,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:04,882 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:04,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:44:04,902 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 1 loop predicates
[2024-11-08 17:44:04,903 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 698 states and 847 transitions. cyclomatic complexity: 174 Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:44:05,278 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 698 states and 847 transitions. cyclomatic complexity: 174. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 729 states and 881 transitions. Complement of second has 16 states.
[2024-11-08 17:44:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 2 accepting loop states
[2024-11-08 17:44:05,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:44:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions.
[2024-11-08 17:44:05,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 79 letters. Loop has 2 letters.
[2024-11-08 17:44:05,284 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:44:05,284 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 17:44:05,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:05,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0
[2024-11-08 17:44:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:05,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 28 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:05,553 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:06,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:06,535 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:44:06,553 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 1 loop predicates
[2024-11-08 17:44:06,553 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 698 states and 847 transitions. cyclomatic complexity: 174 Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:44:06,828 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 698 states and 847 transitions. cyclomatic complexity: 174. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 729 states and 881 transitions. Complement of second has 14 states.
[2024-11-08 17:44:06,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states
[2024-11-08 17:44:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:44:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions.
[2024-11-08 17:44:06,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 55 transitions. Stem has 79 letters. Loop has 2 letters.
[2024-11-08 17:44:06,831 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:44:06,831 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 17:44:06,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:06,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 38 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:07,000 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:07,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:07,772 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:44:07,786 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 1 loop predicates
[2024-11-08 17:44:07,786 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 698 states and 847 transitions. cyclomatic complexity: 174 Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:44:08,141 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 698 states and 847 transitions. cyclomatic complexity: 174. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1044 states and 1267 transitions. Complement of second has 20 states.
[2024-11-08 17:44:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 2 accepting loop states
[2024-11-08 17:44:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:44:08,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 73 transitions.
[2024-11-08 17:44:08,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 73 transitions. Stem has 79 letters. Loop has 2 letters.
[2024-11-08 17:44:08,144 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:44:08,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 73 transitions. Stem has 81 letters. Loop has 2 letters.
[2024-11-08 17:44:08,145 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:44:08,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 73 transitions. Stem has 79 letters. Loop has 4 letters.
[2024-11-08 17:44:08,145 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:44:08,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1044 states and 1267 transitions.
[2024-11-08 17:44:08,154 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 303
[2024-11-08 17:44:08,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1044 states to 1015 states and 1216 transitions.
[2024-11-08 17:44:08,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 929
[2024-11-08 17:44:08,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 937
[2024-11-08 17:44:08,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1015 states and 1216 transitions.
[2024-11-08 17:44:08,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:44:08,165 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1015 states and 1216 transitions.
[2024-11-08 17:44:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 1216 transitions.
[2024-11-08 17:44:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 966.
[2024-11-08 17:44:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 916 states have (on average 1.1692139737991267) internal successors, (1071), 907 states have internal predecessors, (1071), 32 states have call successors, (33), 18 states have call predecessors, (33), 18 states have return successors, (57), 40 states have call predecessors, (57), 30 states have call successors, (57)
[2024-11-08 17:44:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1161 transitions.
[2024-11-08 17:44:08,186 INFO L240 hiAutomatonCegarLoop]: Abstraction has 966 states and 1161 transitions.
[2024-11-08 17:44:08,186 INFO L425 stractBuchiCegarLoop]: Abstraction has 966 states and 1161 transitions.
[2024-11-08 17:44:08,186 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============
[2024-11-08 17:44:08,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 966 states and 1161 transitions.
[2024-11-08 17:44:08,192 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 303
[2024-11-08 17:44:08,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:44:08,193 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:44:08,193 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:44:08,194 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2024-11-08 17:44:08,194 INFO L745 eck$LassoCheckResult]: Stem: 18999#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 18939#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 18940#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 18948#L40-3 assume main_~i~1#1 < main_~n~0#1; 18949#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 18950#L40-3 assume main_~i~1#1 < main_~n~0#1; 18951#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 19007#L40-3 assume main_~i~1#1 < main_~n~0#1; 19006#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 19005#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 18994#L40-4 havoc main_~i~1#1; 18916#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 18917#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19035#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 19032#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 19033#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19041#L24 assume ~n#1 < 2; 19039#merge_sortFINAL assume true; 19031#merge_sortEXIT >#85#return; 19028#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 19029#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19078#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 19074#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 19076#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19082#L24 assume ~n#1 < 2; 19081#merge_sortFINAL assume true; 19073#merge_sortEXIT >#85#return; 19069#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 19071#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19080#L24 assume ~n#1 < 2; 19072#merge_sortFINAL assume true; 19067#merge_sortEXIT >#87#return; 19066#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 19065#L11-3 assume merge_~k~0#1 < merge_~n#1; 19064#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 19063#L12 assume !(merge_~j~0#1 == merge_~n#1); 19062#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 19059#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 19057#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 19055#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 19053#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 19051#L11-3 assume merge_~k~0#1 < merge_~n#1; 19049#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 19047#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 19046#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 19045#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 19044#L11-4 merge_~i~0#1 := 0; 19043#L17-3 assume merge_~i~0#1 < merge_~n#1; 19042#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 19040#L17-3 assume merge_~i~0#1 < merge_~n#1; 19038#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 19037#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 19036#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 19034#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 19030#merge_sortFINAL assume true; 19027#merge_sortEXIT >#87#return; 19026#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 19025#L11-3 assume merge_~k~0#1 < merge_~n#1; 19024#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 19023#L12 assume !(merge_~j~0#1 == merge_~n#1); 19022#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 19020#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 19019#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 19018#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 19017#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 19016#L11-3 assume merge_~k~0#1 < merge_~n#1; 19014#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 19015#L12 assume !(merge_~j~0#1 == merge_~n#1); 19008#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 19009#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 19099#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 19098#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 19097#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 19096#L11-3 assume merge_~k~0#1 < merge_~n#1; 19094#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 19095#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 19873#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 19872#L11-3 assume merge_~k~0#1 < merge_~n#1; 19871#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 18952#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 18953#L12-2
[2024-11-08 17:44:08,194 INFO L747 eck$LassoCheckResult]: Loop: 18953#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 19878#L11-3 assume merge_~k~0#1 < merge_~n#1; 19877#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 19013#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 18953#L12-2
[2024-11-08 17:44:08,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:08,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1596798946, now seen corresponding path program 7 times
[2024-11-08 17:44:08,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:08,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068123432]
[2024-11-08 17:44:08,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:08,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:08,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2024-11-08 17:44:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:08,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-08 17:44:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:08,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:44:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:08,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:44:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 55 proven. 32 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2024-11-08 17:44:08,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:44:08,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068123432]
[2024-11-08 17:44:08,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068123432] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:44:08,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494350584]
[2024-11-08 17:44:08,615 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-08 17:44:08,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:44:08,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:08,618 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:44:08,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process
[2024-11-08 17:44:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:08,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:08,851 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:09,066 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 68 proven. 19 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2024-11-08 17:44:09,066 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:44:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 68 proven. 19 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2024-11-08 17:44:09,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494350584] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:44:09,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:44:09,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 20
[2024-11-08 17:44:09,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407472709]
[2024-11-08 17:44:09,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:44:09,251 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:44:09,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:09,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2036874, now seen corresponding path program 1 times
[2024-11-08 17:44:09,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:09,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740440809]
[2024-11-08 17:44:09,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:09,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:09,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:09,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:09,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:44:09,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-11-08 17:44:09,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380
[2024-11-08 17:44:09,398 INFO L87 Difference]: Start difference. First operand 966 states and 1161 transitions. cyclomatic complexity: 231 Second operand has 20 states, 20 states have (on average 4.65) internal successors, (93), 18 states have internal predecessors, (93), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:44:09,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:44:09,821 INFO L93 Difference]: Finished difference Result 941 states and 1124 transitions.
[2024-11-08 17:44:09,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 941 states and 1124 transitions.
[2024-11-08 17:44:09,829 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 291
[2024-11-08 17:44:09,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 941 states to 842 states and 1019 transitions.
[2024-11-08 17:44:09,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 816
[2024-11-08 17:44:09,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 816
[2024-11-08 17:44:09,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 842 states and 1019 transitions.
[2024-11-08 17:44:09,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:44:09,837 INFO L218 hiAutomatonCegarLoop]: Abstraction has 842 states and 1019 transitions.
[2024-11-08 17:44:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states and 1019 transitions.
[2024-11-08 17:44:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 841.
[2024-11-08 17:44:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 798 states have (on average 1.1741854636591478) internal successors, (937), 789 states have internal predecessors, (937), 27 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (53), 36 states have call predecessors, (53), 26 states have call successors, (53)
[2024-11-08 17:44:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1018 transitions.
[2024-11-08 17:44:09,855 INFO L240 hiAutomatonCegarLoop]: Abstraction has 841 states and 1018 transitions.
[2024-11-08 17:44:09,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2024-11-08 17:44:09,857 INFO L425 stractBuchiCegarLoop]: Abstraction has 841 states and 1018 transitions.
[2024-11-08 17:44:09,857 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============
[2024-11-08 17:44:09,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 841 states and 1018 transitions.
[2024-11-08 17:44:09,862 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 291
[2024-11-08 17:44:09,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:44:09,862 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:44:09,863 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:44:09,863 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:44:09,864 INFO L745 eck$LassoCheckResult]: Stem: 21451#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 21398#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 21399#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 21410#L40-3 assume main_~i~1#1 < main_~n~0#1; 21411#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 21412#L40-3 assume main_~i~1#1 < main_~n~0#1; 21413#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 21449#L40-3 assume main_~i~1#1 < main_~n~0#1; 21457#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 21456#L40-3 assume main_~i~1#1 < main_~n~0#1; 21454#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 21453#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 21448#L40-4 havoc main_~i~1#1; 21385#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 21386#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21455#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 21406#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 21426#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21434#L24 assume ~n#1 < 2; 21481#merge_sortFINAL assume true; 21478#merge_sortEXIT >#85#return; 21440#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 21504#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21464#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 21465#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 21480#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21498#L24 assume ~n#1 < 2; 21497#merge_sortFINAL assume true; 21479#merge_sortEXIT >#85#return; 21431#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 21430#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 21432#L24 assume ~n#1 < 2; 21613#merge_sortFINAL assume true; 21599#merge_sortEXIT >#87#return; 21595#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 21591#L11-3 assume merge_~k~0#1 < merge_~n#1; 21572#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 21571#L12 assume !(merge_~j~0#1 == merge_~n#1); 21570#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 21567#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 21565#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 21563#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 21561#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 21559#L11-3 assume merge_~k~0#1 < merge_~n#1; 21557#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 21552#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 21549#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 21462#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 21463#L11-4 merge_~i~0#1 := 0; 21458#L17-3 assume merge_~i~0#1 < merge_~n#1; 21459#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 21439#L17-3 assume merge_~i~0#1 < merge_~n#1; 21442#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 21469#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 21470#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 21751#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 21749#merge_sortFINAL assume true; 21746#merge_sortEXIT >#87#return; 21747#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 22194#L11-3 assume merge_~k~0#1 < merge_~n#1; 22193#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 22192#L12 assume !(merge_~j~0#1 == merge_~n#1); 22191#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 22189#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 22188#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 22187#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 22186#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 22185#L11-3 assume merge_~k~0#1 < merge_~n#1; 22184#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 22183#L12 assume !(merge_~j~0#1 == merge_~n#1); 22175#L13
[2024-11-08 17:44:09,864 INFO L747 eck$LassoCheckResult]: Loop: 22175#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 22181#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 22180#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 22179#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 22178#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 22177#L11-3 assume merge_~k~0#1 < merge_~n#1; 22176#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 22173#L12 assume !(merge_~j~0#1 == merge_~n#1); 22175#L13
[2024-11-08 17:44:09,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:09,864 INFO L85 PathProgramCache]: Analyzing trace with hash -42780506, now seen corresponding path program 8 times
[2024-11-08 17:44:09,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:09,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238842383]
[2024-11-08 17:44:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:09,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:10,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:44:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:10,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:44:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:10,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:44:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:10,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:44:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 25 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2024-11-08 17:44:10,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:44:10,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238842383]
[2024-11-08 17:44:10,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238842383] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:44:10,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934512047]
[2024-11-08 17:44:10,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 17:44:10,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:44:10,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:10,278 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:44:10,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process
[2024-11-08 17:44:10,496 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 17:44:10,496 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:44:10,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 18 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:10,500 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 30 proven. 23 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2024-11-08 17:44:10,695 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:44:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2024-11-08 17:44:11,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934512047] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:44:11,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:44:11,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 22
[2024-11-08 17:44:11,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392673330]
[2024-11-08 17:44:11,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:44:11,201 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:44:11,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1501942833, now seen corresponding path program 6 times
[2024-11-08 17:44:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:11,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671795690]
[2024-11-08 17:44:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:11,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:11,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:11,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:44:11,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-11-08 17:44:11,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462
[2024-11-08 17:44:11,477 INFO L87 Difference]: Start difference. First operand 841 states and 1018 transitions. cyclomatic complexity: 208 Second operand has 22 states, 17 states have (on average 4.529411764705882) internal successors, (77), 16 states have internal predecessors, (77), 11 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 7 states have call predecessors, (12), 10 states have call successors, (12)
[2024-11-08 17:44:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:44:11,944 INFO L93 Difference]: Finished difference Result 1010 states and 1248 transitions.
[2024-11-08 17:44:11,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1010 states and 1248 transitions.
[2024-11-08 17:44:11,953 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 409
[2024-11-08 17:44:11,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1010 states to 1010 states and 1248 transitions.
[2024-11-08 17:44:11,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 981
[2024-11-08 17:44:11,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 981
[2024-11-08 17:44:11,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1010 states and 1248 transitions.
[2024-11-08 17:44:11,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:44:11,961 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1010 states and 1248 transitions.
[2024-11-08 17:44:11,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states and 1248 transitions.
[2024-11-08 17:44:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 812.
[2024-11-08 17:44:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 770 states have (on average 1.1766233766233767) internal successors, (906), 762 states have internal predecessors, (906), 26 states have call successors, (27), 15 states have call predecessors, (27), 16 states have return successors, (51), 34 states have call predecessors, (51), 25 states have call successors, (51)
[2024-11-08 17:44:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 984 transitions.
[2024-11-08 17:44:11,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 812 states and 984 transitions.
[2024-11-08 17:44:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2024-11-08 17:44:11,987 INFO L425 stractBuchiCegarLoop]: Abstraction has 812 states and 984 transitions.
[2024-11-08 17:44:11,987 INFO L332 stractBuchiCegarLoop]: ======== Iteration 23 ============
[2024-11-08 17:44:11,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 812 states and 984 transitions.
[2024-11-08 17:44:11,992 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 283
[2024-11-08 17:44:11,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:44:11,992 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:44:11,995 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:44:11,995 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:44:11,995 INFO L745 eck$LassoCheckResult]: Stem: 23814#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 23761#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 23762#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 23773#L40-3 assume main_~i~1#1 < main_~n~0#1; 23774#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 23775#L40-3 assume main_~i~1#1 < main_~n~0#1; 23776#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 23822#L40-3 assume main_~i~1#1 < main_~n~0#1; 23821#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 23820#L40-3 assume main_~i~1#1 < main_~n~0#1; 23819#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 23818#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 23813#L40-4 havoc main_~i~1#1; 23749#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 23750#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23823#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 23752#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 23789#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23797#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 23753#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 23789#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23797#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 23753#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 23789#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23798#L24 assume ~n#1 < 2; 23841#merge_sortFINAL assume true; 23838#merge_sortEXIT >#85#return; 23805#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 23831#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23832#L24 assume ~n#1 < 2; 23932#merge_sortFINAL assume true; 23931#merge_sortEXIT >#87#return; 23930#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 23929#L11-3 assume merge_~k~0#1 < merge_~n#1; 23927#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 23925#L12 assume !(merge_~j~0#1 == merge_~n#1); 23923#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 23919#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 23914#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 23910#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 23906#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 23902#L11-3 assume merge_~k~0#1 < merge_~n#1; 23898#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 23894#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 23891#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 23889#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 23887#L11-4 merge_~i~0#1 := 0; 23885#L17-3 assume merge_~i~0#1 < merge_~n#1; 23883#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 23881#L17-3 assume merge_~i~0#1 < merge_~n#1; 23879#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 23878#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 23875#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 23873#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 23871#merge_sortFINAL assume true; 23869#merge_sortEXIT >#85#return; 23770#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 23864#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 23985#L24 assume ~n#1 < 2; 23783#merge_sortFINAL assume true; 23781#merge_sortEXIT >#87#return; 23782#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 24504#L11-3 assume merge_~k~0#1 < merge_~n#1; 24500#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 24501#L12 assume !(merge_~j~0#1 == merge_~n#1); 24496#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 24497#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 24516#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 24515#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 24514#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 24512#L11-3 assume merge_~k~0#1 < merge_~n#1; 24511#L11-1
[2024-11-08 17:44:11,996 INFO L747 eck$LassoCheckResult]: Loop: 24511#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 24508#L12 assume !(merge_~j~0#1 == merge_~n#1); 24510#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 24521#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 24520#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 24519#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 24518#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 24513#L11-3 assume merge_~k~0#1 < merge_~n#1; 24511#L11-1
[2024-11-08 17:44:11,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1695548935, now seen corresponding path program 9 times
[2024-11-08 17:44:11,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:11,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683681570]
[2024-11-08 17:44:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:11,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:12,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19
[2024-11-08 17:44:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:12,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:44:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:12,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:44:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:12,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:44:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 25 proven. 39 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2024-11-08 17:44:12,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:44:12,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683681570]
[2024-11-08 17:44:12,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683681570] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:44:12,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332025644]
[2024-11-08 17:44:12,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-08 17:44:12,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:44:12,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:12,816 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:44:12,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process
[2024-11-08 17:44:13,107 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2024-11-08 17:44:13,107 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:44:13,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:13,112 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked.
[2024-11-08 17:44:13,286 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:44:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked.
[2024-11-08 17:44:13,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332025644] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:44:13,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:44:13,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 27
[2024-11-08 17:44:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804883103]
[2024-11-08 17:44:13,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:44:13,543 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:44:13,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1757394127, now seen corresponding path program 7 times
[2024-11-08 17:44:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:13,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599434246]
[2024-11-08 17:44:13,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:13,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:13,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:13,557 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:13,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:44:13,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-11-08 17:44:13,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702
[2024-11-08 17:44:13,821 INFO L87 Difference]: Start difference. First operand 812 states and 984 transitions. cyclomatic complexity: 202 Second operand has 27 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 11 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10)
[2024-11-08 17:44:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:44:14,782 INFO L93 Difference]: Finished difference Result 1110 states and 1358 transitions.
[2024-11-08 17:44:14,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1110 states and 1358 transitions.
[2024-11-08 17:44:14,790 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 442
[2024-11-08 17:44:14,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1110 states to 1106 states and 1353 transitions.
[2024-11-08 17:44:14,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1068
[2024-11-08 17:44:14,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1074
[2024-11-08 17:44:14,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1106 states and 1353 transitions.
[2024-11-08 17:44:14,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:44:14,798 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1106 states and 1353 transitions.
[2024-11-08 17:44:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states and 1353 transitions.
[2024-11-08 17:44:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 758.
[2024-11-08 17:44:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 710 states have (on average 1.176056338028169) internal successors, (835), 707 states have internal predecessors, (835), 33 states have call successors, (34), 17 states have call predecessors, (34), 15 states have return successors, (53), 33 states have call predecessors, (53), 31 states have call successors, (53)
[2024-11-08 17:44:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 922 transitions.
[2024-11-08 17:44:14,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 758 states and 922 transitions.
[2024-11-08 17:44:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2024-11-08 17:44:14,817 INFO L425 stractBuchiCegarLoop]: Abstraction has 758 states and 922 transitions.
[2024-11-08 17:44:14,817 INFO L332 stractBuchiCegarLoop]: ======== Iteration 24 ============
[2024-11-08 17:44:14,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 758 states and 922 transitions.
[2024-11-08 17:44:14,821 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 269
[2024-11-08 17:44:14,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:44:14,821 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:44:14,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:44:14,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:44:14,822 INFO L745 eck$LassoCheckResult]: Stem: 26271#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 26225#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 26226#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 26235#L40-3 assume main_~i~1#1 < main_~n~0#1; 26236#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 26237#L40-3 assume main_~i~1#1 < main_~n~0#1; 26238#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 26269#L40-3 assume main_~i~1#1 < main_~n~0#1; 26283#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 26282#L40-3 assume main_~i~1#1 < main_~n~0#1; 26281#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 26280#L40-3 assume main_~i~1#1 < main_~n~0#1; 26279#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 26278#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 26270#L40-4 havoc main_~i~1#1; 26217#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 26275#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26276#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 26250#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 26251#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26258#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 26257#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 26251#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26256#L24 assume ~n#1 < 2; 26304#merge_sortFINAL assume true; 26305#merge_sortEXIT >#85#return; 26232#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 26368#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26290#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 26291#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 26303#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26373#L24 assume ~n#1 < 2; 26372#merge_sortFINAL assume true; 26302#merge_sortEXIT >#85#return; 26260#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 26261#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26264#L24 assume ~n#1 < 2; 26265#merge_sortFINAL assume true; 26414#merge_sortEXIT >#87#return; 26413#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 26412#L11-3 assume merge_~k~0#1 < merge_~n#1; 26411#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 26410#L12 assume !(merge_~j~0#1 == merge_~n#1); 26409#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 26406#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 26404#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 26402#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 26400#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 26398#L11-3 assume merge_~k~0#1 < merge_~n#1; 26396#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 26394#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 26393#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 26392#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 26391#L11-4 merge_~i~0#1 := 0; 26284#L17-3 assume merge_~i~0#1 < merge_~n#1; 26285#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 26263#L17-3 assume merge_~i~0#1 < merge_~n#1; 26231#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 26233#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 26455#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 26726#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 26722#merge_sortFINAL assume true; 26242#merge_sortEXIT >#87#return; 26243#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 26904#L11-3 assume merge_~k~0#1 < merge_~n#1; 26903#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 26902#L12 assume !(merge_~j~0#1 == merge_~n#1); 26901#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 26899#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 26898#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 26897#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 26896#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 26895#L11-3 assume merge_~k~0#1 < merge_~n#1; 26894#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 26893#L12 assume !(merge_~j~0#1 == merge_~n#1); 26885#L13
[2024-11-08 17:44:14,823 INFO L747 eck$LassoCheckResult]: Loop: 26885#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 26891#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 26890#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 26889#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 26888#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 26887#L11-3 assume merge_~k~0#1 < merge_~n#1; 26886#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 26884#L12 assume !(merge_~j~0#1 == merge_~n#1); 26885#L13
[2024-11-08 17:44:14,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:14,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1970115091, now seen corresponding path program 10 times
[2024-11-08 17:44:14,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:14,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752270549]
[2024-11-08 17:44:14,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:14,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:15,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2024-11-08 17:44:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:15,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26
[2024-11-08 17:44:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:15,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:44:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:15,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:44:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:15,444 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 31 proven. 46 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2024-11-08 17:44:15,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:44:15,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752270549]
[2024-11-08 17:44:15,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752270549] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:44:15,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514845360]
[2024-11-08 17:44:15,445 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-08 17:44:15,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:44:15,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:15,448 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:44:15,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process
[2024-11-08 17:44:15,858 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-08 17:44:15,858 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:44:15,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 18 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:15,862 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 30 proven. 47 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2024-11-08 17:44:15,990 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:44:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 30 proven. 47 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2024-11-08 17:44:16,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514845360] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:44:16,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:44:16,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 24
[2024-11-08 17:44:16,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974041826]
[2024-11-08 17:44:16,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:44:16,334 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:44:16,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1501942833, now seen corresponding path program 8 times
[2024-11-08 17:44:16,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:16,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680372671]
[2024-11-08 17:44:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:16,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:16,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:16,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:16,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:44:16,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-11-08 17:44:16,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552
[2024-11-08 17:44:16,621 INFO L87 Difference]: Start difference. First operand 758 states and 922 transitions. cyclomatic complexity: 193 Second operand has 24 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 7 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10)
[2024-11-08 17:44:17,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:44:17,224 INFO L93 Difference]: Finished difference Result 906 states and 1096 transitions.
[2024-11-08 17:44:17,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 906 states and 1096 transitions.
[2024-11-08 17:44:17,231 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 304
[2024-11-08 17:44:17,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 906 states to 866 states and 1052 transitions.
[2024-11-08 17:44:17,237 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 827
[2024-11-08 17:44:17,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 827
[2024-11-08 17:44:17,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 866 states and 1052 transitions.
[2024-11-08 17:44:17,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:44:17,238 INFO L218 hiAutomatonCegarLoop]: Abstraction has 866 states and 1052 transitions.
[2024-11-08 17:44:17,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states and 1052 transitions.
[2024-11-08 17:44:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 801.
[2024-11-08 17:44:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 749 states have (on average 1.1735647530040054) internal successors, (879), 747 states have internal predecessors, (879), 36 states have call successors, (37), 19 states have call predecessors, (37), 16 states have return successors, (55), 34 states have call predecessors, (55), 33 states have call successors, (55)
[2024-11-08 17:44:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 971 transitions.
[2024-11-08 17:44:17,263 INFO L240 hiAutomatonCegarLoop]: Abstraction has 801 states and 971 transitions.
[2024-11-08 17:44:17,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2024-11-08 17:44:17,267 INFO L425 stractBuchiCegarLoop]: Abstraction has 801 states and 971 transitions.
[2024-11-08 17:44:17,268 INFO L332 stractBuchiCegarLoop]: ======== Iteration 25 ============
[2024-11-08 17:44:17,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 801 states and 971 transitions.
[2024-11-08 17:44:17,272 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 269
[2024-11-08 17:44:17,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:44:17,273 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:44:17,273 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:44:17,273 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:44:17,274 INFO L745 eck$LassoCheckResult]: Stem: 28494#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 28441#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 28442#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 28451#L40-3 assume main_~i~1#1 < main_~n~0#1; 28452#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28502#L40-3 assume main_~i~1#1 < main_~n~0#1; 28491#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28492#L40-3 assume main_~i~1#1 < main_~n~0#1; 28503#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28453#L40-3 assume main_~i~1#1 < main_~n~0#1; 28454#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28509#L40-3 assume main_~i~1#1 < main_~n~0#1; 28500#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28501#L40-3 assume main_~i~1#1 < main_~n~0#1; 28499#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 28498#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 28490#L40-4 havoc main_~i~1#1; 28430#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 28506#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28558#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 28486#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 28536#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28485#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 28487#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 28536#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28478#L24 assume ~n#1 < 2; 28612#merge_sortFINAL assume true; 28605#merge_sortEXIT >#85#return; 28448#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 28599#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28611#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 28603#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 28604#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28610#L24 assume ~n#1 < 2; 28609#merge_sortFINAL assume true; 28602#merge_sortEXIT >#85#return; 28592#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 28597#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 28607#L24 assume ~n#1 < 2; 28600#merge_sortFINAL assume true; 28591#merge_sortEXIT >#87#return; 28593#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 28658#L11-3 assume merge_~k~0#1 < merge_~n#1; 28654#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 28655#L12 assume !(merge_~j~0#1 == merge_~n#1); 28650#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 28651#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 28646#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 28647#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 28707#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 28705#L11-3 assume merge_~k~0#1 < merge_~n#1; 28704#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 28562#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 28563#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 28514#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 28515#L11-4 merge_~i~0#1 := 0; 28510#L17-3 assume merge_~i~0#1 < merge_~n#1; 28511#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 28483#L17-3 assume merge_~i~0#1 < merge_~n#1; 28447#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 28449#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 28713#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 28767#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 28765#merge_sortFINAL assume true; 28763#merge_sortEXIT >#87#return; 28759#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 28757#L11-3 assume merge_~k~0#1 < merge_~n#1; 28755#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 28753#L12 assume !(merge_~j~0#1 == merge_~n#1); 28751#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 28748#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 28749#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 28820#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 28819#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 28817#L11-3 assume merge_~k~0#1 < merge_~n#1; 28815#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 28811#L12 assume !(merge_~j~0#1 == merge_~n#1); 28810#L13
[2024-11-08 17:44:17,274 INFO L747 eck$LassoCheckResult]: Loop: 28810#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 28808#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 28809#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 28818#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 28816#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 28814#L11-3 assume merge_~k~0#1 < merge_~n#1; 28813#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 28812#L12 assume !(merge_~j~0#1 == merge_~n#1); 28810#L13
[2024-11-08 17:44:17,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:17,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1337331256, now seen corresponding path program 11 times
[2024-11-08 17:44:17,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:17,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875560828]
[2024-11-08 17:44:17,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:17,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:17,342 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:17,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:17,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:17,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1501942833, now seen corresponding path program 9 times
[2024-11-08 17:44:17,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:17,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371914353]
[2024-11-08 17:44:17,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:17,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:17,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:17,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:17,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash 738311016, now seen corresponding path program 12 times
[2024-11-08 17:44:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003770665]
[2024-11-08 17:44:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:18,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2024-11-08 17:44:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:18,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28
[2024-11-08 17:44:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:18,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:44:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:18,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:44:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 10 proven. 105 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2024-11-08 17:44:18,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:44:18,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003770665]
[2024-11-08 17:44:18,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003770665] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:44:18,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307736313]
[2024-11-08 17:44:18,527 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-08 17:44:18,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:44:18,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:18,529 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:44:18,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process
[2024-11-08 17:44:18,849 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s)
[2024-11-08 17:44:18,849 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:44:18,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 29 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:18,859 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 37 proven. 25 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2024-11-08 17:44:19,392 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:44:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 37 proven. 25 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2024-11-08 17:44:19,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307736313] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:44:19,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:44:19,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 41
[2024-11-08 17:44:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527572952]
[2024-11-08 17:44:19,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:44:20,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:44:20,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-11-08 17:44:20,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1561, Unknown=0, NotChecked=0, Total=1722
[2024-11-08 17:44:20,068 INFO L87 Difference]: Start difference. First operand 801 states and 971 transitions. cyclomatic complexity: 201 Second operand has 42 states, 37 states have (on average 3.5945945945945947) internal successors, (133), 36 states have internal predecessors, (133), 9 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 6 states have call predecessors, (10), 7 states have call successors, (10)
[2024-11-08 17:44:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:44:22,419 INFO L93 Difference]: Finished difference Result 1327 states and 1614 transitions.
[2024-11-08 17:44:22,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1327 states and 1614 transitions.
[2024-11-08 17:44:22,431 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 402
[2024-11-08 17:44:22,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1327 states to 1324 states and 1609 transitions.
[2024-11-08 17:44:22,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1244
[2024-11-08 17:44:22,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1256
[2024-11-08 17:44:22,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1324 states and 1609 transitions.
[2024-11-08 17:44:22,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:44:22,446 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1324 states and 1609 transitions.
[2024-11-08 17:44:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states and 1609 transitions.
[2024-11-08 17:44:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 943.
[2024-11-08 17:44:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 877 states have (on average 1.1584948688711516) internal successors, (1016), 878 states have internal predecessors, (1016), 46 states have call successors, (47), 23 states have call predecessors, (47), 20 states have return successors, (86), 41 states have call predecessors, (86), 42 states have call successors, (86)
[2024-11-08 17:44:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1149 transitions.
[2024-11-08 17:44:22,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 943 states and 1149 transitions.
[2024-11-08 17:44:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states.
[2024-11-08 17:44:22,473 INFO L425 stractBuchiCegarLoop]: Abstraction has 943 states and 1149 transitions.
[2024-11-08 17:44:22,473 INFO L332 stractBuchiCegarLoop]: ======== Iteration 26 ============
[2024-11-08 17:44:22,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 943 states and 1149 transitions.
[2024-11-08 17:44:22,479 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 275
[2024-11-08 17:44:22,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:44:22,479 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:44:22,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:44:22,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1]
[2024-11-08 17:44:22,481 INFO L745 eck$LassoCheckResult]: Stem: 31296#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 31247#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 31248#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 31257#L40-3 assume main_~i~1#1 < main_~n~0#1; 31258#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31259#L40-3 assume main_~i~1#1 < main_~n~0#1; 31260#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31314#L40-3 assume main_~i~1#1 < main_~n~0#1; 31313#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31312#L40-3 assume main_~i~1#1 < main_~n~0#1; 31311#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31308#L40-3 assume main_~i~1#1 < main_~n~0#1; 31307#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31305#L40-3 assume main_~i~1#1 < main_~n~0#1; 31304#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 31303#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 31293#L40-4 havoc main_~i~1#1; 31228#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 31229#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31416#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 31316#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 31415#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31414#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 31410#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 31411#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31279#L24 assume ~n#1 < 2; 31413#merge_sortFINAL assume true; 31408#merge_sortEXIT >#85#return; 31272#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 31407#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31418#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 31271#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 31273#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31277#L24 assume ~n#1 < 2; 31421#merge_sortFINAL assume true; 31420#merge_sortEXIT >#85#return; 31289#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 31419#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 31288#L24 assume ~n#1 < 2; 31290#merge_sortFINAL assume true; 31522#merge_sortEXIT >#87#return; 31521#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 31520#L11-3 assume merge_~k~0#1 < merge_~n#1; 31519#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 31518#L12 assume !(merge_~j~0#1 == merge_~n#1); 31517#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 31515#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 31513#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 31511#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 31509#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31507#L11-3 assume merge_~k~0#1 < merge_~n#1; 31505#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 31503#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 31501#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31500#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 31499#L11-4 merge_~i~0#1 := 0; 31498#L17-3 assume merge_~i~0#1 < merge_~n#1; 31497#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 31489#L17-3 assume merge_~i~0#1 < merge_~n#1; 31484#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 31483#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 31482#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 31481#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 31480#merge_sortFINAL assume true; 31479#merge_sortEXIT >#87#return; 31478#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 31477#L11-3 assume merge_~k~0#1 < merge_~n#1; 31476#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 31475#L12 assume !(merge_~j~0#1 == merge_~n#1); 31474#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 31472#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 31471#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 31470#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 31469#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31468#L11-3 assume merge_~k~0#1 < merge_~n#1; 31467#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 31466#L12 assume !(merge_~j~0#1 == merge_~n#1); 31465#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 31463#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 31461#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 31459#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 31457#L12-2
[2024-11-08 17:44:22,482 INFO L747 eck$LassoCheckResult]: Loop: 31457#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 31453#L11-3 assume merge_~k~0#1 < merge_~n#1; 31454#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 31460#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 31457#L12-2
[2024-11-08 17:44:22,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:22,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1293972701, now seen corresponding path program 13 times
[2024-11-08 17:44:22,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:22,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058837233]
[2024-11-08 17:44:22,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:22,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:22,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:22,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:22,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:22,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2036874, now seen corresponding path program 2 times
[2024-11-08 17:44:22,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:22,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896101807]
[2024-11-08 17:44:22,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:22,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:22,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:22,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:22,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash 738311014, now seen corresponding path program 14 times
[2024-11-08 17:44:22,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:22,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223785804]
[2024-11-08 17:44:22,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:22,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:22,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:22,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:40,259 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 17:44:40,259 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 17:44:40,259 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 17:44:40,259 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 17:44:40,259 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 17:44:40,259 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:40,259 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 17:44:40,259 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 17:44:40,259 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration26_Lasso
[2024-11-08 17:44:40,260 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 17:44:40,260 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 17:44:40,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:40,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:40,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:40,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:40,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:40,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:40,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:40,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:40,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:40,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:40,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:40,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,977 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:41,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:44:42,935 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 17:44:42,936 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 17:44:42,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:42,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:42,939 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:42,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process
[2024-11-08 17:44:42,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:42,952 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:42,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:42,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:42,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:42,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:42,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:42,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:42,954 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:42,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0
[2024-11-08 17:44:42,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:42,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:42,968 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:42,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process
[2024-11-08 17:44:42,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:42,981 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:42,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:42,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:42,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:42,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:42,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:42,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:42,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:42,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0
[2024-11-08 17:44:42,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:42,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:42,996 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:42,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process
[2024-11-08 17:44:42,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:43,009 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:43,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:43,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:43,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:43,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:43,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:43,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:43,011 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:43,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0
[2024-11-08 17:44:43,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:43,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:43,023 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:43,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process
[2024-11-08 17:44:43,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:43,035 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:43,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:43,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:43,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:43,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:43,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:43,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:43,037 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:43,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0
[2024-11-08 17:44:43,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:43,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:43,050 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:43,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process
[2024-11-08 17:44:43,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:43,063 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:43,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:43,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:43,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:43,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:43,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:43,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:43,065 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:43,077 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0
[2024-11-08 17:44:43,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:43,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:43,079 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:43,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process
[2024-11-08 17:44:43,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:43,091 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:43,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:43,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:43,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:43,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:43,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:43,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:43,093 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:43,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0
[2024-11-08 17:44:43,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:43,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:43,106 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:43,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process
[2024-11-08 17:44:43,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:43,118 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:43,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:43,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:43,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:43,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:43,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:43,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:43,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:43,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0
[2024-11-08 17:44:43,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:43,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:43,135 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:43,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process
[2024-11-08 17:44:43,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:43,147 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:43,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:43,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:43,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:43,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:43,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:43,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:43,149 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:43,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0
[2024-11-08 17:44:43,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:43,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:43,163 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:43,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process
[2024-11-08 17:44:43,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:43,175 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:43,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:43,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:43,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:43,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:43,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:43,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:43,177 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:43,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0
[2024-11-08 17:44:43,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:43,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:43,191 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:43,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process
[2024-11-08 17:44:43,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:43,203 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:43,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:43,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:43,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:43,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:43,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:43,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:43,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:43,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0
[2024-11-08 17:44:43,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:43,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:43,217 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:43,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process
[2024-11-08 17:44:43,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:43,230 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:43,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:43,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:43,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:43,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:43,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:43,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:43,232 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:43,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0
[2024-11-08 17:44:43,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:43,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:43,244 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:43,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process
[2024-11-08 17:44:43,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:43,256 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:43,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:44:43,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:43,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:43,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:43,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:44:43,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:44:43,258 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:43,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0
[2024-11-08 17:44:43,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:43,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:43,270 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:43,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process
[2024-11-08 17:44:43,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:43,283 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:43,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:43,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:43,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:43,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:44:43,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:44:43,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:44:43,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0
[2024-11-08 17:44:43,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:43,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:43,302 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:43,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process
[2024-11-08 17:44:43,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:44:43,315 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:44:43,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:44:43,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:44:43,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:44:43,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:44:43,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:44:43,337 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 17:44:43,371 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver.
[2024-11-08 17:44:43,371 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero.
[2024-11-08 17:44:43,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:44:43,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:43,374 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:44:43,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process
[2024-11-08 17:44:43,404 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 17:44:43,417 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2.
[2024-11-08 17:44:43,417 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 17:44:43,418 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_merge_~i~0#1, merge_sort_merge_~a#1.offset) = -4*merge_sort_merge_~i~0#1 - 1*merge_sort_merge_~a#1.offset + 36893488147419103218
Supporting invariants [-1*v_rep(select #length merge_sort_merge_~a#1.base)_4 + 18446744073709551612 >= 0]
[2024-11-08 17:44:43,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0
[2024-11-08 17:44:43,543 INFO L156 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed
[2024-11-08 17:44:43,545 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~a!offset
[2024-11-08 17:44:43,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:43,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 80 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:43,689 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:43,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-11-08 17:44:43,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1
[2024-11-08 17:44:44,889 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size
[2024-11-08 17:44:44,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13
[2024-11-08 17:44:45,067 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-08 17:44:45,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9
[2024-11-08 17:44:45,077 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-08 17:44:45,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11
[2024-11-08 17:44:45,085 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-08 17:44:45,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9
[2024-11-08 17:44:45,092 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-08 17:44:45,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11
[2024-11-08 17:44:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:45,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:45,265 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:44:45,292 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.15 stem predicates 1 loop predicates
[2024-11-08 17:44:45,293 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 943 states and 1149 transitions. cyclomatic complexity: 256 Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-08 17:44:45,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0
[2024-11-08 17:44:45,999 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 943 states and 1149 transitions. cyclomatic complexity: 256. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 982 states and 1191 transitions. Complement of second has 24 states.
[2024-11-08 17:44:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 8 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-08 17:44:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-08 17:44:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions.
[2024-11-08 17:44:46,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 35 transitions. Stem has 81 letters. Loop has 4 letters.
[2024-11-08 17:44:46,001 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:44:46,001 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 17:44:46,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:46,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 80 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:46,173 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:46,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1
[2024-11-08 17:44:46,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-11-08 17:44:47,392 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size
[2024-11-08 17:44:47,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13
[2024-11-08 17:44:47,545 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-08 17:44:47,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9
[2024-11-08 17:44:47,556 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-08 17:44:47,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11
[2024-11-08 17:44:47,571 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-08 17:44:47,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9
[2024-11-08 17:44:47,581 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-08 17:44:47,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11
[2024-11-08 17:44:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:47,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:47,746 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:44:47,780 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.15 stem predicates 1 loop predicates
[2024-11-08 17:44:47,780 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 943 states and 1149 transitions. cyclomatic complexity: 256 Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-08 17:44:48,499 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 943 states and 1149 transitions. cyclomatic complexity: 256. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 982 states and 1191 transitions. Complement of second has 24 states.
[2024-11-08 17:44:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 8 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-08 17:44:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-08 17:44:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions.
[2024-11-08 17:44:48,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 35 transitions. Stem has 81 letters. Loop has 4 letters.
[2024-11-08 17:44:48,501 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:44:48,501 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 17:44:48,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:48,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 80 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:48,661 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:48,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-11-08 17:44:48,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1
[2024-11-08 17:44:49,846 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size
[2024-11-08 17:44:49,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13
[2024-11-08 17:44:49,987 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-08 17:44:49,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9
[2024-11-08 17:44:49,999 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-08 17:44:49,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11
[2024-11-08 17:44:50,011 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-08 17:44:50,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9
[2024-11-08 17:44:50,026 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-08 17:44:50,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11
[2024-11-08 17:44:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:50,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:50,159 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:44:50,186 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.15 stem predicates 1 loop predicates
[2024-11-08 17:44:50,186 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 943 states and 1149 transitions. cyclomatic complexity: 256 Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-08 17:44:52,056 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 943 states and 1149 transitions. cyclomatic complexity: 256. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 1491 states and 1787 transitions. Complement of second has 107 states.
[2024-11-08 17:44:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 21 stem states 1 non-accepting loop states 2 accepting loop states
[2024-11-08 17:44:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2024-11-08 17:44:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 159 transitions.
[2024-11-08 17:44:52,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 159 transitions. Stem has 81 letters. Loop has 4 letters.
[2024-11-08 17:44:52,058 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:44:52,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 159 transitions. Stem has 85 letters. Loop has 4 letters.
[2024-11-08 17:44:52,059 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:44:52,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 159 transitions. Stem has 81 letters. Loop has 8 letters.
[2024-11-08 17:44:52,059 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:44:52,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1491 states and 1787 transitions.
[2024-11-08 17:44:52,070 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 315
[2024-11-08 17:44:52,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1491 states to 1409 states and 1688 transitions.
[2024-11-08 17:44:52,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1104
[2024-11-08 17:44:52,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1245
[2024-11-08 17:44:52,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1409 states and 1688 transitions.
[2024-11-08 17:44:52,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:44:52,082 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1409 states and 1688 transitions.
[2024-11-08 17:44:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states and 1688 transitions.
[2024-11-08 17:44:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1290.
[2024-11-08 17:44:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1210 states have (on average 1.1504132231404958) internal successors, (1392), 1207 states have internal predecessors, (1392), 55 states have call successors, (56), 28 states have call predecessors, (56), 25 states have return successors, (93), 54 states have call predecessors, (93), 51 states have call successors, (93)
[2024-11-08 17:44:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1541 transitions.
[2024-11-08 17:44:52,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1290 states and 1541 transitions.
[2024-11-08 17:44:52,109 INFO L425 stractBuchiCegarLoop]: Abstraction has 1290 states and 1541 transitions.
[2024-11-08 17:44:52,109 INFO L332 stractBuchiCegarLoop]: ======== Iteration 27 ============
[2024-11-08 17:44:52,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1541 transitions.
[2024-11-08 17:44:52,115 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 309
[2024-11-08 17:44:52,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:44:52,116 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:44:52,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:44:52,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:44:52,117 INFO L745 eck$LassoCheckResult]: Stem: 36851#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 36791#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 36792#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 36804#L40-3 assume main_~i~1#1 < main_~n~0#1; 36805#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 36806#L40-3 assume main_~i~1#1 < main_~n~0#1; 36807#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 36877#L40-3 assume main_~i~1#1 < main_~n~0#1; 36876#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 36875#L40-3 assume main_~i~1#1 < main_~n~0#1; 36874#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 36873#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 36850#L40-4 havoc main_~i~1#1; 36776#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 36966#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 36957#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 36941#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 36949#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 36946#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 36931#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 36934#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 36832#L24 assume ~n#1 < 2; 36940#merge_sortFINAL assume true; 36929#merge_sortEXIT >#85#return; 36932#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 36918#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37044#L24 assume ~n#1 < 2; 37043#merge_sortFINAL assume true; 37041#merge_sortEXIT >#87#return; 37040#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 37039#L11-3 assume merge_~k~0#1 < merge_~n#1; 37038#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 37037#L12 assume !(merge_~j~0#1 == merge_~n#1); 37036#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 37034#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 37032#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 37030#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37028#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37026#L11-3 assume merge_~k~0#1 < merge_~n#1; 37024#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 37022#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 36989#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 36988#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 36987#L11-4 merge_~i~0#1 := 0; 36986#L17-3 assume merge_~i~0#1 < merge_~n#1; 36985#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 36982#L17-3 assume merge_~i~0#1 < merge_~n#1; 36977#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 36976#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 36973#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 36965#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 36956#merge_sortFINAL assume true; 36955#merge_sortEXIT >#85#return; 36938#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 36954#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 36950#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 36924#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 36933#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 36945#L24 assume ~n#1 < 2; 36937#merge_sortFINAL assume true; 36923#merge_sortEXIT >#85#return; 36927#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 37067#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37069#L24 assume ~n#1 < 2; 37068#merge_sortFINAL assume true; 37065#merge_sortEXIT >#87#return; 37066#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 37195#L11-3 assume merge_~k~0#1 < merge_~n#1; 37194#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 37193#L12 assume !(merge_~j~0#1 == merge_~n#1); 37192#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 37190#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 37188#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 37186#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37184#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37182#L11-3 assume merge_~k~0#1 < merge_~n#1; 37180#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 37178#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 37174#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 37173#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 37172#L11-4 merge_~i~0#1 := 0; 37171#L17-3 assume merge_~i~0#1 < merge_~n#1; 37170#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37169#L17-3 assume merge_~i~0#1 < merge_~n#1; 37168#L17-1
[2024-11-08 17:44:52,117 INFO L747 eck$LassoCheckResult]: Loop: 37168#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 37167#L17-3 assume merge_~i~0#1 < merge_~n#1; 37168#L17-1
[2024-11-08 17:44:52,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:52,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1009302422, now seen corresponding path program 15 times
[2024-11-08 17:44:52,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:52,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225416492]
[2024-11-08 17:44:52,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:52,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:52,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:52,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:52,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2556, now seen corresponding path program 4 times
[2024-11-08 17:44:52,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:52,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550188944]
[2024-11-08 17:44:52,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:52,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:52,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:52,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:52,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:52,237 INFO L85 PathProgramCache]: Analyzing trace with hash 722982949, now seen corresponding path program 16 times
[2024-11-08 17:44:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:52,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262852266]
[2024-11-08 17:44:52,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:52,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:53,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 17:44:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:53,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:44:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:53,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:44:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:53,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2024-11-08 17:44:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:53,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61
[2024-11-08 17:44:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:44:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 51 proven. 43 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked.
[2024-11-08 17:44:53,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:44:53,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262852266]
[2024-11-08 17:44:53,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262852266] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:44:53,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478036730]
[2024-11-08 17:44:53,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-08 17:44:53,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:44:53,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:44:53,167 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:44:53,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process
[2024-11-08 17:44:53,722 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-08 17:44:53,723 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:44:53,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 17:44:53,727 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:44:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 43 proven. 6 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked.
[2024-11-08 17:44:53,869 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:44:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 43 proven. 6 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked.
[2024-11-08 17:44:54,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478036730] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:44:54,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:44:54,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8, 8] total 27
[2024-11-08 17:44:54,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183720993]
[2024-11-08 17:44:54,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:44:54,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:44:54,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2024-11-08 17:44:54,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756
[2024-11-08 17:44:54,087 INFO L87 Difference]: Start difference. First operand 1290 states and 1541 transitions. cyclomatic complexity: 315 Second operand has 28 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 25 states have internal predecessors, (87), 4 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2024-11-08 17:44:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:44:55,019 INFO L93 Difference]: Finished difference Result 2203 states and 2583 transitions.
[2024-11-08 17:44:55,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2203 states and 2583 transitions.
[2024-11-08 17:44:55,033 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 317
[2024-11-08 17:44:55,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2203 states to 2203 states and 2583 transitions.
[2024-11-08 17:44:55,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1910
[2024-11-08 17:44:55,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1934
[2024-11-08 17:44:55,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2203 states and 2583 transitions.
[2024-11-08 17:44:55,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:44:55,049 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2203 states and 2583 transitions.
[2024-11-08 17:44:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2203 states and 2583 transitions.
[2024-11-08 17:44:55,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2203 to 1655.
[2024-11-08 17:44:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1567 states have (on average 1.152520740268028) internal successors, (1806), 1564 states have internal predecessors, (1806), 57 states have call successors, (58), 33 states have call predecessors, (58), 31 states have return successors, (95), 57 states have call predecessors, (95), 53 states have call successors, (95)
[2024-11-08 17:44:55,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 1959 transitions.
[2024-11-08 17:44:55,084 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1655 states and 1959 transitions.
[2024-11-08 17:44:55,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states.
[2024-11-08 17:44:55,085 INFO L425 stractBuchiCegarLoop]: Abstraction has 1655 states and 1959 transitions.
[2024-11-08 17:44:55,085 INFO L332 stractBuchiCegarLoop]: ======== Iteration 28 ============
[2024-11-08 17:44:55,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1655 states and 1959 transitions.
[2024-11-08 17:44:55,093 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 303
[2024-11-08 17:44:55,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:44:55,093 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:44:55,094 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:44:55,094 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:44:55,094 INFO L745 eck$LassoCheckResult]: Stem: 40993#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 40936#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 40937#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 40950#L40-3 assume main_~i~1#1 < main_~n~0#1; 40951#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 40952#L40-3 assume main_~i~1#1 < main_~n~0#1; 40953#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 41014#L40-3 assume main_~i~1#1 < main_~n~0#1; 41013#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 41012#L40-3 assume main_~i~1#1 < main_~n~0#1; 41011#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 41009#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 40992#L40-4 havoc main_~i~1#1; 40914#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 40915#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41385#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 41381#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41382#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41459#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 41457#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41458#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41461#L24 assume ~n#1 < 2; 41460#merge_sortFINAL assume true; 41456#merge_sortEXIT >#85#return; 41453#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41454#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41466#L24 assume ~n#1 < 2; 41465#merge_sortFINAL assume true; 41452#merge_sortEXIT >#87#return; 41447#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 41443#L11-3 assume merge_~k~0#1 < merge_~n#1; 41441#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 41439#L12 assume !(merge_~j~0#1 == merge_~n#1); 41437#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 41433#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 41430#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 41425#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41421#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 41417#L11-3 assume merge_~k~0#1 < merge_~n#1; 41413#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 41409#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 41406#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 41403#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 41401#L11-4 merge_~i~0#1 := 0; 41399#L17-3 assume merge_~i~0#1 < merge_~n#1; 41397#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 41395#L17-3 assume merge_~i~0#1 < merge_~n#1; 41393#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 41391#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 41389#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 41387#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 41384#merge_sortFINAL assume true; 41380#merge_sortEXIT >#85#return; 41377#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41378#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41464#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 41450#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 41451#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41463#L24 assume ~n#1 < 2; 41462#merge_sortFINAL assume true; 41449#merge_sortEXIT >#85#return; 41445#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 41446#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 41455#L24 assume ~n#1 < 2; 41448#merge_sortFINAL assume true; 41444#merge_sortEXIT >#87#return; 41442#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 41440#L11-3 assume merge_~k~0#1 < merge_~n#1; 41438#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 41436#L12 assume !(merge_~j~0#1 == merge_~n#1); 41432#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 41427#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 41423#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 41419#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41415#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 41411#L11-3 assume merge_~k~0#1 < merge_~n#1; 41407#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 41404#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 41402#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 41400#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 41398#L11-4 merge_~i~0#1 := 0; 41396#L17-3 assume merge_~i~0#1 < merge_~n#1; 41394#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 41392#L17-3 assume merge_~i~0#1 < merge_~n#1; 41390#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 41388#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 41386#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 41383#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 41379#merge_sortFINAL assume true; 41376#merge_sortEXIT >#87#return; 41174#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 41375#L11-3 assume merge_~k~0#1 < merge_~n#1; 41374#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 41373#L12 assume !(merge_~j~0#1 == merge_~n#1); 41372#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 41370#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 41371#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 41366#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 41367#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 42537#L11-3
[2024-11-08 17:44:55,095 INFO L747 eck$LassoCheckResult]: Loop: 42537#L11-3 assume merge_~k~0#1 < merge_~n#1; 42535#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 42533#L12 assume !(merge_~j~0#1 == merge_~n#1); 42515#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 40966#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 40967#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 42539#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 42538#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 42537#L11-3
[2024-11-08 17:44:55,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:55,095 INFO L85 PathProgramCache]: Analyzing trace with hash -383247445, now seen corresponding path program 17 times
[2024-11-08 17:44:55,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:55,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017072754]
[2024-11-08 17:44:55,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:55,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:55,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:55,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:55,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2124867537, now seen corresponding path program 10 times
[2024-11-08 17:44:55,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:55,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657281586]
[2024-11-08 17:44:55,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:55,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:55,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:55,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:44:55,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:44:55,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1828043131, now seen corresponding path program 18 times
[2024-11-08 17:44:55,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:44:55,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205193485]
[2024-11-08 17:44:55,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:44:55,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:44:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:55,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:44:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:44:55,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:45:09,595 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 17:45:09,595 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 17:45:09,596 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 17:45:09,596 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 17:45:09,596 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 17:45:09,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:45:09,596 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 17:45:09,596 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 17:45:09,596 INFO L132 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration28_Lasso
[2024-11-08 17:45:09,596 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 17:45:09,596 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 17:45:09,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:09,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:09,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:09,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,092 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,099 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:12,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 17:45:13,848 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 17:45:13,848 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 17:45:13,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:45:13,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:13,850 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:45:13,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process
[2024-11-08 17:45:13,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:45:13,864 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:45:13,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:45:13,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:45:13,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:45:13,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:45:13,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:45:13,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:45:13,866 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:45:13,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0
[2024-11-08 17:45:13,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:45:13,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:13,880 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:45:13,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process
[2024-11-08 17:45:13,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:45:13,893 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:45:13,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:45:13,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:45:13,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:45:13,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:45:13,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:45:13,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:45:13,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:45:13,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0
[2024-11-08 17:45:13,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:45:13,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:13,908 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:45:13,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process
[2024-11-08 17:45:13,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:45:13,921 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:45:13,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:45:13,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:45:13,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:45:13,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:45:13,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:45:13,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:45:13,923 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:45:13,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0
[2024-11-08 17:45:13,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:45:13,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:13,936 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:45:13,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process
[2024-11-08 17:45:13,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:45:13,949 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:45:13,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:45:13,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:45:13,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:45:13,951 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:45:13,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:45:13,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:45:13,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0
[2024-11-08 17:45:13,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:45:13,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:13,969 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:45:13,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process
[2024-11-08 17:45:13,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:45:13,981 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:45:13,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:45:13,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:45:13,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:45:13,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-11-08 17:45:13,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-11-08 17:45:13,986 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:45:13,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0
[2024-11-08 17:45:13,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:45:13,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:13,999 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:45:14,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process
[2024-11-08 17:45:14,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:45:14,011 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:45:14,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 17:45:14,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:45:14,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 17:45:14,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:45:14,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 17:45:14,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 17:45:14,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 17:45:14,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0
[2024-11-08 17:45:14,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:45:14,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:14,026 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:45:14,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process
[2024-11-08 17:45:14,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 17:45:14,039 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 17:45:14,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 17:45:14,040 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts
[2024-11-08 17:45:14,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 17:45:14,123 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications.
[2024-11-08 17:45:14,123 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added.
[2024-11-08 17:45:14,513 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 17:45:15,671 INFO L443 ModelExtractionUtils]: Simplification made 63 calls to the SMT solver.
[2024-11-08 17:45:15,671 INFO L444 ModelExtractionUtils]: 9 out of 109 variables were initially zero. Simplification set additionally 97 variables to zero.
[2024-11-08 17:45:15,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 17:45:15,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:15,674 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 17:45:15,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process
[2024-11-08 17:45:15,676 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 17:45:15,692 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8.
[2024-11-08 17:45:15,693 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 17:45:15,693 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(merge_sort_merge_~k~0#1, merge_sort_merge_~n#1) = -1*merge_sort_merge_~k~0#1 + 1*merge_sort_merge_~n#1
Supporting invariants []
[2024-11-08 17:45:15,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0
[2024-11-08 17:45:15,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0
[2024-11-08 17:45:15,941 INFO L156 tatePredicateManager]: 39 out of 39 supporting invariants were superfluous and have been removed
[2024-11-08 17:45:15,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:16,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-08 17:45:16,101 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:45:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:16,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 17:45:16,653 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:45:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:45:16,692 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates
[2024-11-08 17:45:16,692 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1655 states and 1959 transitions. cyclomatic complexity: 362 Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:45:16,759 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1655 states and 1959 transitions. cyclomatic complexity: 362. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1683 states and 1991 transitions. Complement of second has 7 states.
[2024-11-08 17:45:16,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-08 17:45:16,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:45:16,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions.
[2024-11-08 17:45:16,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 99 letters. Loop has 8 letters.
[2024-11-08 17:45:16,761 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:45:16,761 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 17:45:16,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:16,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-08 17:45:16,922 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:45:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:17,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 17:45:17,476 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:45:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:45:17,510 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates
[2024-11-08 17:45:17,510 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1655 states and 1959 transitions. cyclomatic complexity: 362 Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:45:17,562 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1655 states and 1959 transitions. cyclomatic complexity: 362. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1683 states and 1991 transitions. Complement of second has 7 states.
[2024-11-08 17:45:17,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-08 17:45:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:45:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions.
[2024-11-08 17:45:17,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 99 letters. Loop has 8 letters.
[2024-11-08 17:45:17,563 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:45:17,563 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 17:45:17,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:17,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-08 17:45:17,727 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:45:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:18,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 17:45:18,321 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:45:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 17:45:18,356 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates
[2024-11-08 17:45:18,356 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1655 states and 1959 transitions. cyclomatic complexity: 362 Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:45:18,413 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1655 states and 1959 transitions. cyclomatic complexity: 362. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 2393 states and 2825 transitions. Complement of second has 9 states.
[2024-11-08 17:45:18,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-08 17:45:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 17:45:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions.
[2024-11-08 17:45:18,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 99 letters. Loop has 8 letters.
[2024-11-08 17:45:18,416 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:45:18,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 107 letters. Loop has 8 letters.
[2024-11-08 17:45:18,417 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:45:18,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 99 letters. Loop has 16 letters.
[2024-11-08 17:45:18,417 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 17:45:18,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2393 states and 2825 transitions.
[2024-11-08 17:45:18,433 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 28
[2024-11-08 17:45:18,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2393 states to 1474 states and 1754 transitions.
[2024-11-08 17:45:18,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 650
[2024-11-08 17:45:18,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 792
[2024-11-08 17:45:18,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 1754 transitions.
[2024-11-08 17:45:18,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:45:18,443 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1474 states and 1754 transitions.
[2024-11-08 17:45:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 1754 transitions.
[2024-11-08 17:45:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1450.
[2024-11-08 17:45:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1376 states have (on average 1.160610465116279) internal successors, (1597), 1373 states have internal predecessors, (1597), 50 states have call successors, (51), 26 states have call predecessors, (51), 24 states have return successors, (79), 50 states have call predecessors, (79), 43 states have call successors, (79)
[2024-11-08 17:45:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 1727 transitions.
[2024-11-08 17:45:18,473 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1450 states and 1727 transitions.
[2024-11-08 17:45:18,473 INFO L425 stractBuchiCegarLoop]: Abstraction has 1450 states and 1727 transitions.
[2024-11-08 17:45:18,473 INFO L332 stractBuchiCegarLoop]: ======== Iteration 29 ============
[2024-11-08 17:45:18,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1450 states and 1727 transitions.
[2024-11-08 17:45:18,480 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 26
[2024-11-08 17:45:18,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:45:18,480 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:45:18,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:45:18,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-08 17:45:18,482 INFO L745 eck$LassoCheckResult]: Stem: 49588#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 49521#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 49522#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 49534#L40-3 assume main_~i~1#1 < main_~n~0#1; 49535#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 49536#L40-3 assume main_~i~1#1 < main_~n~0#1; 49537#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 49608#L40-3 assume main_~i~1#1 < main_~n~0#1; 49607#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 49606#L40-3 assume main_~i~1#1 < main_~n~0#1; 49605#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 49604#L40-3 assume main_~i~1#1 < main_~n~0#1; 49603#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 49601#L40-3 assume main_~i~1#1 < main_~n~0#1; 49600#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 49599#L40-3 assume main_~i~1#1 < main_~n~0#1; 49598#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 49597#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 49595#L40-4 havoc main_~i~1#1; 49552#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 49593#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49594#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 49527#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49553#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49562#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 49526#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49553#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49562#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 49526#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49553#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49562#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 49526#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49553#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49561#L24 assume ~n#1 < 2; 49668#merge_sortFINAL assume true; 49662#merge_sortEXIT >#85#return; 49658#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 49659#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49715#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 49711#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49712#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49716#L24 assume ~n#1 < 2; 49714#merge_sortFINAL assume true; 49710#merge_sortEXIT >#85#return; 49707#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 49708#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49713#L24 assume ~n#1 < 2; 49709#merge_sortFINAL assume true; 49706#merge_sortEXIT >#87#return; 49705#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 49704#L11-3 assume merge_~k~0#1 < merge_~n#1; 49703#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 49702#L12 assume !(merge_~j~0#1 == merge_~n#1); 49701#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 49698#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 49696#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 49694#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 49692#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 49690#L11-3 assume merge_~k~0#1 < merge_~n#1; 49688#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 49686#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 49685#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 49684#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 49683#L11-4 merge_~i~0#1 := 0; 49682#L17-3 assume merge_~i~0#1 < merge_~n#1; 49681#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 49680#L17-3 assume merge_~i~0#1 < merge_~n#1; 49678#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 49677#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 49675#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 49667#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 49661#merge_sortFINAL assume true; 49657#merge_sortEXIT >#87#return; 49656#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 49655#L11-3 assume merge_~k~0#1 < merge_~n#1; 49654#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 49653#L12 assume !(merge_~j~0#1 == merge_~n#1); 49652#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 49650#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 49648#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 49645#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 49642#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 49640#L11-3 assume merge_~k~0#1 < merge_~n#1; 49638#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 49636#L12 assume !(merge_~j~0#1 == merge_~n#1); 49633#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 49628#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 49627#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 49625#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 49626#L11-4 merge_~i~0#1 := 0; 50202#L17-3 assume merge_~i~0#1 < merge_~n#1; 50201#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 50200#L17-3 assume merge_~i~0#1 < merge_~n#1; 50199#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 50198#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 50196#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 50195#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 50194#merge_sortFINAL assume true; 49977#merge_sortEXIT >#85#return; 49498#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 50193#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50192#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 49932#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49943#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49944#L24 assume ~n#1 < 2; 49579#merge_sortFINAL assume true; 49929#merge_sortEXIT >#85#return; 49925#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 49938#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49937#L24 assume ~n#1 < 2; 49579#merge_sortFINAL assume true; 49929#merge_sortEXIT >#87#return; 49936#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 50360#L11-3 assume merge_~k~0#1 < merge_~n#1; 50359#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 50358#L12 assume !(merge_~j~0#1 == merge_~n#1); 50357#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 50354#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 50352#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 50350#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 50348#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 50346#L11-3 assume merge_~k~0#1 < merge_~n#1; 50344#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 50342#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 50341#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 50340#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 50334#L11-4 merge_~i~0#1 := 0; 50324#L17-3 assume merge_~i~0#1 < merge_~n#1; 50320#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 50313#L17-3 assume merge_~i~0#1 < merge_~n#1; 50312#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 50190#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 50185#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 50101#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 50098#merge_sortFINAL assume true; 50099#merge_sortEXIT >#87#return; 49969#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 49968#L11-3 assume merge_~k~0#1 < merge_~n#1; 49967#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 49966#L12 assume !(merge_~j~0#1 == merge_~n#1); 49965#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 49963#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 49964#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 50139#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 50137#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 50136#L11-3 assume merge_~k~0#1 < merge_~n#1; 50134#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 50132#L12 assume !(merge_~j~0#1 == merge_~n#1); 50129#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 50127#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 50126#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 50123#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 49950#L11-4 merge_~i~0#1 := 0; 50088#L17-3 assume merge_~i~0#1 < merge_~n#1; 50087#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 50086#L17-3 assume merge_~i~0#1 < merge_~n#1; 50085#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 50016#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 49994#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 49985#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 49980#merge_sortFINAL assume true; 49981#merge_sortEXIT >#85#return; 49501#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 49972#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49913#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 49914#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49551#$Ultimate##0
[2024-11-08 17:45:18,482 INFO L747 eck$LassoCheckResult]: Loop: 49551#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 49942#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 49931#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 49551#$Ultimate##0
[2024-11-08 17:45:18,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2019294098, now seen corresponding path program 1 times
[2024-11-08 17:45:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:18,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962867357]
[2024-11-08 17:45:18,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:18,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:18,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25
[2024-11-08 17:45:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:19,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:19,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:19,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:19,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:19,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:19,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 17:45:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:19,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:19,749 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 293 proven. 41 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked.
[2024-11-08 17:45:19,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:45:19,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962867357]
[2024-11-08 17:45:19,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962867357] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:45:19,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125688668]
[2024-11-08 17:45:19,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:19,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:45:19,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:19,752 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:45:19,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process
[2024-11-08 17:45:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:20,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-11-08 17:45:20,173 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:45:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 298 proven. 38 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked.
[2024-11-08 17:45:20,402 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:45:20,780 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 207 proven. 142 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked.
[2024-11-08 17:45:20,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125688668] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:45:20,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:45:20,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 26
[2024-11-08 17:45:20,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795290114]
[2024-11-08 17:45:20,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:45:20,782 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:45:20,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:20,782 INFO L85 PathProgramCache]: Analyzing trace with hash 29999, now seen corresponding path program 5 times
[2024-11-08 17:45:20,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:20,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6704870]
[2024-11-08 17:45:20,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:20,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:20,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:45:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:20,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:45:20,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:45:20,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-11-08 17:45:20,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650
[2024-11-08 17:45:20,971 INFO L87 Difference]: Start difference. First operand 1450 states and 1727 transitions. cyclomatic complexity: 326 Second operand has 26 states, 26 states have (on average 5.423076923076923) internal successors, (141), 23 states have internal predecessors, (141), 4 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12)
[2024-11-08 17:45:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:45:22,263 INFO L93 Difference]: Finished difference Result 1857 states and 2147 transitions.
[2024-11-08 17:45:22,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1857 states and 2147 transitions.
[2024-11-08 17:45:22,271 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 36
[2024-11-08 17:45:22,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1857 states to 1839 states and 2129 transitions.
[2024-11-08 17:45:22,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 762
[2024-11-08 17:45:22,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 762
[2024-11-08 17:45:22,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1839 states and 2129 transitions.
[2024-11-08 17:45:22,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:45:22,284 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1839 states and 2129 transitions.
[2024-11-08 17:45:22,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states and 2129 transitions.
[2024-11-08 17:45:22,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1408.
[2024-11-08 17:45:22,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1334 states have (on average 1.1371814092953523) internal successors, (1517), 1331 states have internal predecessors, (1517), 50 states have call successors, (51), 26 states have call predecessors, (51), 24 states have return successors, (79), 50 states have call predecessors, (79), 43 states have call successors, (79)
[2024-11-08 17:45:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1647 transitions.
[2024-11-08 17:45:22,315 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1408 states and 1647 transitions.
[2024-11-08 17:45:22,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states.
[2024-11-08 17:45:22,316 INFO L425 stractBuchiCegarLoop]: Abstraction has 1408 states and 1647 transitions.
[2024-11-08 17:45:22,317 INFO L332 stractBuchiCegarLoop]: ======== Iteration 30 ============
[2024-11-08 17:45:22,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1408 states and 1647 transitions.
[2024-11-08 17:45:22,322 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 26
[2024-11-08 17:45:22,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:45:22,322 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:45:22,324 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 10, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:45:22,324 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-08 17:45:22,324 INFO L745 eck$LassoCheckResult]: Stem: 54280#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 54214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 54215#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 54226#L40-3 assume main_~i~1#1 < main_~n~0#1; 54227#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 54228#L40-3 assume main_~i~1#1 < main_~n~0#1; 54229#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 54300#L40-3 assume main_~i~1#1 < main_~n~0#1; 54299#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 54298#L40-3 assume main_~i~1#1 < main_~n~0#1; 54297#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 54296#L40-3 assume main_~i~1#1 < main_~n~0#1; 54295#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 54293#L40-3 assume main_~i~1#1 < main_~n~0#1; 54292#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 54291#L40-3 assume main_~i~1#1 < main_~n~0#1; 54290#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 54289#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 54287#L40-4 havoc main_~i~1#1; 54243#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 54285#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 54286#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 54195#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 54244#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 54251#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 54196#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 54244#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 54251#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 54196#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 54244#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 54251#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 54196#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 54244#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 54250#L24 assume ~n#1 < 2; 54354#merge_sortFINAL assume true; 54348#merge_sortEXIT >#85#return; 54344#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 54345#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 54401#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 54397#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 54398#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 54402#L24 assume ~n#1 < 2; 54400#merge_sortFINAL assume true; 54396#merge_sortEXIT >#85#return; 54393#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 54394#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 54399#L24 assume ~n#1 < 2; 54395#merge_sortFINAL assume true; 54392#merge_sortEXIT >#87#return; 54391#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 54390#L11-3 assume merge_~k~0#1 < merge_~n#1; 54389#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 54388#L12 assume !(merge_~j~0#1 == merge_~n#1); 54387#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 54384#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 54382#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 54380#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 54378#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 54376#L11-3 assume merge_~k~0#1 < merge_~n#1; 54374#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 54372#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 54371#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 54370#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 54369#L11-4 merge_~i~0#1 := 0; 54368#L17-3 assume merge_~i~0#1 < merge_~n#1; 54367#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 54366#L17-3 assume merge_~i~0#1 < merge_~n#1; 54365#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 54363#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 54362#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 54353#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 54347#merge_sortFINAL assume true; 54343#merge_sortEXIT >#87#return; 54342#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 54341#L11-3 assume merge_~k~0#1 < merge_~n#1; 54340#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 54339#L12 assume !(merge_~j~0#1 == merge_~n#1); 54338#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 54336#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 54337#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 54335#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 54333#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 54331#L11-3 assume merge_~k~0#1 < merge_~n#1; 54328#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 54326#L12 assume !(merge_~j~0#1 == merge_~n#1); 54324#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 54321#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 54322#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 54412#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 54407#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 54309#L11-3 assume merge_~k~0#1 < merge_~n#1; 54405#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 54406#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 54306#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 54308#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 54636#L11-4 merge_~i~0#1 := 0; 54634#L17-3 assume merge_~i~0#1 < merge_~n#1; 54632#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 54630#L17-3 assume merge_~i~0#1 < merge_~n#1; 54627#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 54626#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 54624#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 54622#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 54620#merge_sortFINAL assume true; 54616#merge_sortEXIT >#85#return; 54206#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 54614#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 54615#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 54241#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 54242#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 54609#L24 assume ~n#1 < 2; 54270#merge_sortFINAL assume true; 54598#merge_sortEXIT >#85#return; 54596#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 54607#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 54608#L24 assume ~n#1 < 2; 54270#merge_sortFINAL assume true; 54598#merge_sortEXIT >#87#return; 54603#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 55020#L11-3 assume merge_~k~0#1 < merge_~n#1; 55019#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 55018#L12 assume !(merge_~j~0#1 == merge_~n#1); 55017#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55015#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 55013#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 55011#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55009#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 55007#L11-3 assume merge_~k~0#1 < merge_~n#1; 55005#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 55003#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 55001#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 55000#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 54999#L11-4 merge_~i~0#1 := 0; 54998#L17-3 assume merge_~i~0#1 < merge_~n#1; 54997#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 54996#L17-3 assume merge_~i~0#1 < merge_~n#1; 54995#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 54923#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 54914#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 54913#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 54239#merge_sortFINAL assume true; 54240#merge_sortEXIT >#87#return; 54733#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 55415#L11-3 assume merge_~k~0#1 < merge_~n#1; 55414#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 55413#L12 assume !(merge_~j~0#1 == merge_~n#1); 55412#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 54245#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 54246#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 55042#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55043#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 55513#L11-3 assume merge_~k~0#1 < merge_~n#1; 55529#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 55528#L12 assume !(merge_~j~0#1 == merge_~n#1); 55527#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 55524#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 55525#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 55559#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 55558#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 55556#L11-3 assume merge_~k~0#1 < merge_~n#1; 55553#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 55548#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 54233#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 55547#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 54303#L11-4 merge_~i~0#1 := 0; 54301#L17-3 assume merge_~i~0#1 < merge_~n#1; 54302#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 54262#L17-3 assume merge_~i~0#1 < merge_~n#1; 54219#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 54220#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 54717#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 54715#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 54713#merge_sortFINAL assume true; 54711#merge_sortEXIT >#85#return; 54202#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 54248#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 54249#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 54601#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 54610#$Ultimate##0
[2024-11-08 17:45:22,325 INFO L747 eck$LassoCheckResult]: Loop: 54610#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 54611#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 54602#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 54610#$Ultimate##0
[2024-11-08 17:45:22,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:22,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1684990386, now seen corresponding path program 19 times
[2024-11-08 17:45:22,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:22,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688767960]
[2024-11-08 17:45:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:22,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:22,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25
[2024-11-08 17:45:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:23,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:23,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:23,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:23,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 17:45:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:24,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:24,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 157 proven. 331 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked.
[2024-11-08 17:45:24,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:45:24,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688767960]
[2024-11-08 17:45:24,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688767960] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:45:24,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428660894]
[2024-11-08 17:45:24,045 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-11-08 17:45:24,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:45:24,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:24,048 INFO L229 MonitoredProcess]: Starting monitored process 138 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:45:24,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process
[2024-11-08 17:45:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:24,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 17:45:24,489 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:45:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 408 proven. 13 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked.
[2024-11-08 17:45:24,632 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:45:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 303 proven. 74 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked.
[2024-11-08 17:45:24,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428660894] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:45:24,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:45:24,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 9] total 26
[2024-11-08 17:45:24,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619666648]
[2024-11-08 17:45:24,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:45:24,855 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:45:24,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash 29999, now seen corresponding path program 6 times
[2024-11-08 17:45:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:24,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646423723]
[2024-11-08 17:45:24,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:24,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:45:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:24,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:45:25,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:45:25,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-11-08 17:45:25,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650
[2024-11-08 17:45:25,093 INFO L87 Difference]: Start difference. First operand 1408 states and 1647 transitions. cyclomatic complexity: 288 Second operand has 26 states, 25 states have (on average 6.16) internal successors, (154), 23 states have internal predecessors, (154), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 7 states have call predecessors, (14), 5 states have call successors, (14)
[2024-11-08 17:45:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:45:26,753 INFO L93 Difference]: Finished difference Result 2505 states and 2983 transitions.
[2024-11-08 17:45:26,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2505 states and 2983 transitions.
[2024-11-08 17:45:26,767 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 46
[2024-11-08 17:45:26,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2505 states to 2505 states and 2983 transitions.
[2024-11-08 17:45:26,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 901
[2024-11-08 17:45:26,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 901
[2024-11-08 17:45:26,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2505 states and 2983 transitions.
[2024-11-08 17:45:26,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:45:26,784 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2505 states and 2983 transitions.
[2024-11-08 17:45:26,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states and 2983 transitions.
[2024-11-08 17:45:26,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 1430.
[2024-11-08 17:45:26,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1356 states have (on average 1.1349557522123894) internal successors, (1539), 1353 states have internal predecessors, (1539), 50 states have call successors, (51), 26 states have call predecessors, (51), 24 states have return successors, (79), 50 states have call predecessors, (79), 43 states have call successors, (79)
[2024-11-08 17:45:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 1669 transitions.
[2024-11-08 17:45:26,821 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1430 states and 1669 transitions.
[2024-11-08 17:45:26,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states.
[2024-11-08 17:45:26,822 INFO L425 stractBuchiCegarLoop]: Abstraction has 1430 states and 1669 transitions.
[2024-11-08 17:45:26,822 INFO L332 stractBuchiCegarLoop]: ======== Iteration 31 ============
[2024-11-08 17:45:26,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1430 states and 1669 transitions.
[2024-11-08 17:45:26,828 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 26
[2024-11-08 17:45:26,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:45:26,828 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:45:26,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 10, 10, 10, 10, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:45:26,830 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-08 17:45:26,830 INFO L745 eck$LassoCheckResult]: Stem: 59704#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 59649#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 59650#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 59660#L40-3 assume main_~i~1#1 < main_~n~0#1; 59661#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 59662#L40-3 assume main_~i~1#1 < main_~n~0#1; 59663#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 59723#L40-3 assume main_~i~1#1 < main_~n~0#1; 59722#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 59721#L40-3 assume main_~i~1#1 < main_~n~0#1; 59720#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 59719#L40-3 assume main_~i~1#1 < main_~n~0#1; 59718#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 59716#L40-3 assume main_~i~1#1 < main_~n~0#1; 59715#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 59714#L40-3 assume main_~i~1#1 < main_~n~0#1; 59713#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 59712#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 59710#L40-4 havoc main_~i~1#1; 59674#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 59708#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59709#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 59631#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 59675#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59685#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 59632#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 59675#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59685#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 59632#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 59675#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59685#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 59632#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 59675#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59684#L24 assume ~n#1 < 2; 59773#merge_sortFINAL assume true; 59768#merge_sortEXIT >#85#return; 59682#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 59766#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59820#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 59816#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 59817#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59821#L24 assume ~n#1 < 2; 59819#merge_sortFINAL assume true; 59815#merge_sortEXIT >#85#return; 59812#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 59813#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59818#L24 assume ~n#1 < 2; 59814#merge_sortFINAL assume true; 59811#merge_sortEXIT >#87#return; 59810#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 59809#L11-3 assume merge_~k~0#1 < merge_~n#1; 59808#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 59807#L12 assume !(merge_~j~0#1 == merge_~n#1); 59806#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 59803#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 59801#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 59799#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 59797#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 59795#L11-3 assume merge_~k~0#1 < merge_~n#1; 59793#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 59791#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 59790#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 59789#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 59788#L11-4 merge_~i~0#1 := 0; 59787#L17-3 assume merge_~i~0#1 < merge_~n#1; 59786#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 59785#L17-3 assume merge_~i~0#1 < merge_~n#1; 59783#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 59782#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 59780#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 59772#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 59767#merge_sortFINAL assume true; 59765#merge_sortEXIT >#87#return; 59764#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 59763#L11-3 assume merge_~k~0#1 < merge_~n#1; 59762#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 59761#L12 assume !(merge_~j~0#1 == merge_~n#1); 59760#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 59758#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 59759#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 59757#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 59755#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 59753#L11-3 assume merge_~k~0#1 < merge_~n#1; 59750#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 59748#L12 assume !(merge_~j~0#1 == merge_~n#1); 59746#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 59743#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 59744#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 60054#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 60053#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 59731#L11-3 assume merge_~k~0#1 < merge_~n#1; 60049#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 59980#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 59728#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 59730#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 59969#L11-4 merge_~i~0#1 := 0; 59968#L17-3 assume merge_~i~0#1 < merge_~n#1; 59967#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 59966#L17-3 assume merge_~i~0#1 < merge_~n#1; 59965#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 59964#L17-3 assume merge_~i~0#1 < merge_~n#1; 59961#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 59960#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 59958#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 59956#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 59954#merge_sortFINAL assume true; 59952#merge_sortEXIT >#85#return; 59635#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 59937#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59936#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 59849#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 59673#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59863#L24 assume ~n#1 < 2; 59837#merge_sortFINAL assume true; 59850#merge_sortEXIT >#85#return; 59841#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 59851#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59862#L24 assume ~n#1 < 2; 59837#merge_sortFINAL assume true; 59850#merge_sortEXIT >#87#return; 59852#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 60462#L11-3 assume merge_~k~0#1 < merge_~n#1; 60461#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 60460#L12 assume !(merge_~j~0#1 == merge_~n#1); 60459#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 60457#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 60458#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 60480#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 60478#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 60476#L11-3 assume merge_~k~0#1 < merge_~n#1; 59645#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 59646#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 59664#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 60484#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 60483#L11-4 merge_~i~0#1 := 0; 60482#L17-3 assume merge_~i~0#1 < merge_~n#1; 60481#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 60479#L17-3 assume merge_~i~0#1 < merge_~n#1; 60477#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 60432#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 59634#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 59639#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 60427#merge_sortFINAL assume true; 60171#merge_sortEXIT >#87#return; 60172#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 60488#L11-3 assume merge_~k~0#1 < merge_~n#1; 60489#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 60469#L12 assume !(merge_~j~0#1 == merge_~n#1); 60470#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 59676#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 59677#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 60490#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 60491#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 59686#L11-3 assume merge_~k~0#1 < merge_~n#1; 59687#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 60926#L12 assume !(merge_~j~0#1 == merge_~n#1); 60927#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 60915#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 60916#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 61013#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 61014#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 61010#L11-3 assume merge_~k~0#1 < merge_~n#1; 61006#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 61007#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 59665#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 61027#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 59726#L11-4 merge_~i~0#1 := 0; 59724#L17-3 assume merge_~i~0#1 < merge_~n#1; 59725#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 60063#L17-3 assume merge_~i~0#1 < merge_~n#1; 59653#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 59654#L17-3 assume merge_~i~0#1 < merge_~n#1; 59692#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 59949#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 59947#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 59945#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 59943#merge_sortFINAL assume true; 59941#merge_sortEXIT >#85#return; 59638#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 59940#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59935#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 59840#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 59867#$Ultimate##0
[2024-11-08 17:45:26,830 INFO L747 eck$LassoCheckResult]: Loop: 59867#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59868#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 59845#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 59867#$Ultimate##0
[2024-11-08 17:45:26,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:26,831 INFO L85 PathProgramCache]: Analyzing trace with hash 347552750, now seen corresponding path program 20 times
[2024-11-08 17:45:26,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:26,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022363632]
[2024-11-08 17:45:26,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:26,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:27,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25
[2024-11-08 17:45:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:28,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:28,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:28,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:28,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:28,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81
[2024-11-08 17:45:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:28,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 263 proven. 251 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked.
[2024-11-08 17:45:28,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:45:28,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022363632]
[2024-11-08 17:45:28,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022363632] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:45:28,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558654001]
[2024-11-08 17:45:28,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 17:45:28,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:45:28,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:28,766 INFO L229 MonitoredProcess]: Starting monitored process 139 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:45:28,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process
[2024-11-08 17:45:29,241 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 17:45:29,241 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:45:29,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 18 conjuncts are in the unsatisfiable core
[2024-11-08 17:45:29,252 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:45:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 308 proven. 207 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked.
[2024-11-08 17:45:29,640 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:45:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 730 backedges. 350 proven. 134 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked.
[2024-11-08 17:45:30,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558654001] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:45:30,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:45:30,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 36
[2024-11-08 17:45:30,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708604976]
[2024-11-08 17:45:30,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:45:30,227 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:45:30,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:30,227 INFO L85 PathProgramCache]: Analyzing trace with hash 29999, now seen corresponding path program 7 times
[2024-11-08 17:45:30,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:30,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025869846]
[2024-11-08 17:45:30,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:30,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:30,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:45:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:30,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:45:30,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:45:30,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2024-11-08 17:45:30,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260
[2024-11-08 17:45:30,396 INFO L87 Difference]: Start difference. First operand 1430 states and 1669 transitions. cyclomatic complexity: 288 Second operand has 36 states, 32 states have (on average 5.78125) internal successors, (185), 29 states have internal predecessors, (185), 11 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (19), 13 states have call predecessors, (19), 10 states have call successors, (19)
[2024-11-08 17:45:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:45:32,592 INFO L93 Difference]: Finished difference Result 2501 states and 2881 transitions.
[2024-11-08 17:45:32,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2501 states and 2881 transitions.
[2024-11-08 17:45:32,607 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 26
[2024-11-08 17:45:32,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2501 states to 2500 states and 2880 transitions.
[2024-11-08 17:45:32,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 770
[2024-11-08 17:45:32,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 770
[2024-11-08 17:45:32,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2500 states and 2880 transitions.
[2024-11-08 17:45:32,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:45:32,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2500 states and 2880 transitions.
[2024-11-08 17:45:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states and 2880 transitions.
[2024-11-08 17:45:32,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2162.
[2024-11-08 17:45:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2162 states, 2087 states have (on average 1.1432678485864878) internal successors, (2386), 2079 states have internal predecessors, (2386), 50 states have call successors, (51), 27 states have call predecessors, (51), 25 states have return successors, (80), 55 states have call predecessors, (80), 43 states have call successors, (80)
[2024-11-08 17:45:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 2517 transitions.
[2024-11-08 17:45:32,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2162 states and 2517 transitions.
[2024-11-08 17:45:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states.
[2024-11-08 17:45:32,667 INFO L425 stractBuchiCegarLoop]: Abstraction has 2162 states and 2517 transitions.
[2024-11-08 17:45:32,667 INFO L332 stractBuchiCegarLoop]: ======== Iteration 32 ============
[2024-11-08 17:45:32,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2162 states and 2517 transitions.
[2024-11-08 17:45:32,677 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 26
[2024-11-08 17:45:32,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:45:32,678 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:45:32,679 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 7, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:45:32,679 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:45:32,679 INFO L745 eck$LassoCheckResult]: Stem: 65170#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 65110#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 65111#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 65124#L40-3 assume main_~i~1#1 < main_~n~0#1; 65125#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 65126#L40-3 assume main_~i~1#1 < main_~n~0#1; 65127#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 65191#L40-3 assume main_~i~1#1 < main_~n~0#1; 65190#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 65189#L40-3 assume main_~i~1#1 < main_~n~0#1; 65188#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 65187#L40-3 assume main_~i~1#1 < main_~n~0#1; 65186#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 65184#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 65168#L40-4 havoc main_~i~1#1; 65169#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 65254#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 65252#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 65249#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 65251#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 65250#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 65244#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 65246#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 65148#L24 assume ~n#1 < 2; 65248#merge_sortFINAL assume true; 65242#merge_sortEXIT >#85#return; 65245#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 65239#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 65414#L24 assume ~n#1 < 2; 65412#merge_sortFINAL assume true; 65406#merge_sortEXIT >#87#return; 65407#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 65445#L11-3 assume merge_~k~0#1 < merge_~n#1; 65444#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 65443#L12 assume !(merge_~j~0#1 == merge_~n#1); 65442#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 65439#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 65437#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 65435#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 65433#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 65431#L11-3 assume merge_~k~0#1 < merge_~n#1; 65429#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 65427#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 65426#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 65425#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 65424#L11-4 merge_~i~0#1 := 0; 65423#L17-3 assume merge_~i~0#1 < merge_~n#1; 65422#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 65421#L17-3 assume merge_~i~0#1 < merge_~n#1; 65420#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 65419#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 65418#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 65417#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 65416#merge_sortFINAL assume true; 65415#merge_sortEXIT >#85#return; 65103#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 65331#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 65411#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 65404#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 65405#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 65410#L24 assume ~n#1 < 2; 65409#merge_sortFINAL assume true; 65402#merge_sortEXIT >#85#return; 65395#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 65398#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 65413#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 65403#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 65405#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 65410#L24 assume ~n#1 < 2; 65409#merge_sortFINAL assume true; 65402#merge_sortEXIT >#85#return; 65396#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 65401#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 65408#L24 assume ~n#1 < 2; 65400#merge_sortFINAL assume true; 65394#merge_sortEXIT >#87#return; 65397#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 66036#L11-3 assume merge_~k~0#1 < merge_~n#1; 66035#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 66034#L12 assume !(merge_~j~0#1 == merge_~n#1); 66033#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 66031#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 66030#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 66029#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 66028#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 66027#L11-3 assume merge_~k~0#1 < merge_~n#1; 66026#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 66023#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 66017#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 66018#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 66083#L11-4 merge_~i~0#1 := 0; 66082#L17-3 assume merge_~i~0#1 < merge_~n#1; 66081#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 66080#L17-3 assume merge_~i~0#1 < merge_~n#1; 66079#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 66078#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 66077#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 66076#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 66075#merge_sortFINAL assume true; 66074#merge_sortEXIT >#87#return; 66073#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 66072#L11-3 assume merge_~k~0#1 < merge_~n#1; 66071#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 66069#L12 assume !(merge_~j~0#1 == merge_~n#1); 66066#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 66063#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 66061#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 66059#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 66056#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 66054#L11-3 assume merge_~k~0#1 < merge_~n#1; 66052#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 66050#L12 assume !(merge_~j~0#1 == merge_~n#1); 66048#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 66045#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 66043#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 66040#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 66037#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 66020#L11-3 assume merge_~k~0#1 < merge_~n#1; 66022#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 66021#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 66019#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 66013#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 65164#L11-4 merge_~i~0#1 := 0; 65165#L17-3 assume merge_~i~0#1 < merge_~n#1; 65116#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 65117#L17-3 assume merge_~i~0#1 < merge_~n#1; 66098#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 66099#L17-3 assume merge_~i~0#1 < merge_~n#1; 66095#L17-1
[2024-11-08 17:45:32,680 INFO L747 eck$LassoCheckResult]: Loop: 66095#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 66096#L17-3 assume merge_~i~0#1 < merge_~n#1; 66095#L17-1
[2024-11-08 17:45:32,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:32,680 INFO L85 PathProgramCache]: Analyzing trace with hash 840690065, now seen corresponding path program 21 times
[2024-11-08 17:45:32,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:32,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436424544]
[2024-11-08 17:45:32,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:32,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:32,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:45:32,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:32,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:45:32,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2556, now seen corresponding path program 5 times
[2024-11-08 17:45:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:32,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821572760]
[2024-11-08 17:45:32,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:32,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:45:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:32,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:45:32,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:32,935 INFO L85 PathProgramCache]: Analyzing trace with hash 449302412, now seen corresponding path program 22 times
[2024-11-08 17:45:32,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:32,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205329939]
[2024-11-08 17:45:32,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:32,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:33,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-08 17:45:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:33,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:33,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58
[2024-11-08 17:45:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:33,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63
[2024-11-08 17:45:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 70 proven. 182 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked.
[2024-11-08 17:45:33,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:45:33,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205329939]
[2024-11-08 17:45:33,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205329939] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:45:33,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199175430]
[2024-11-08 17:45:33,916 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-08 17:45:33,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:45:33,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:33,918 INFO L229 MonitoredProcess]: Starting monitored process 140 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:45:33,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process
[2024-11-08 17:45:34,920 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-08 17:45:34,920 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:45:34,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-08 17:45:34,928 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:45:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 123 proven. 19 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked.
[2024-11-08 17:45:35,173 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:45:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 123 proven. 19 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked.
[2024-11-08 17:45:35,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199175430] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:45:35,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:45:35,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 10, 10] total 31
[2024-11-08 17:45:35,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195016358]
[2024-11-08 17:45:35,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:45:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:45:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-11-08 17:45:35,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992
[2024-11-08 17:45:35,460 INFO L87 Difference]: Start difference. First operand 2162 states and 2517 transitions. cyclomatic complexity: 410 Second operand has 32 states, 30 states have (on average 3.933333333333333) internal successors, (118), 29 states have internal predecessors, (118), 5 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2024-11-08 17:45:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:45:36,958 INFO L93 Difference]: Finished difference Result 2846 states and 3273 transitions.
[2024-11-08 17:45:36,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2846 states and 3273 transitions.
[2024-11-08 17:45:36,971 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 26
[2024-11-08 17:45:36,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2846 states to 2646 states and 3056 transitions.
[2024-11-08 17:45:36,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 760
[2024-11-08 17:45:36,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 766
[2024-11-08 17:45:36,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2646 states and 3056 transitions.
[2024-11-08 17:45:36,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:45:36,992 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2646 states and 3056 transitions.
[2024-11-08 17:45:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states and 3056 transitions.
[2024-11-08 17:45:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2200.
[2024-11-08 17:45:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2200 states, 2130 states have (on average 1.1417840375586854) internal successors, (2432), 2121 states have internal predecessors, (2432), 46 states have call successors, (47), 25 states have call predecessors, (47), 24 states have return successors, (77), 53 states have call predecessors, (77), 40 states have call successors, (77)
[2024-11-08 17:45:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 2556 transitions.
[2024-11-08 17:45:37,033 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2200 states and 2556 transitions.
[2024-11-08 17:45:37,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states.
[2024-11-08 17:45:37,039 INFO L425 stractBuchiCegarLoop]: Abstraction has 2200 states and 2556 transitions.
[2024-11-08 17:45:37,039 INFO L332 stractBuchiCegarLoop]: ======== Iteration 33 ============
[2024-11-08 17:45:37,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2200 states and 2556 transitions.
[2024-11-08 17:45:37,048 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 26
[2024-11-08 17:45:37,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:45:37,048 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:45:37,049 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:45:37,049 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:45:37,050 INFO L745 eck$LassoCheckResult]: Stem: 71169#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 71104#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 71105#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 71114#L40-3 assume main_~i~1#1 < main_~n~0#1; 71115#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 71116#L40-3 assume main_~i~1#1 < main_~n~0#1; 71117#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 71186#L40-3 assume main_~i~1#1 < main_~n~0#1; 71185#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 71184#L40-3 assume main_~i~1#1 < main_~n~0#1; 71183#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 71182#L40-3 assume main_~i~1#1 < main_~n~0#1; 71181#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 71180#L40-3 assume main_~i~1#1 < main_~n~0#1; 71179#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 71178#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 71165#L40-4 havoc main_~i~1#1; 71082#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 71083#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 71265#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 71190#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 71262#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 71263#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 71257#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 71259#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 71139#L24 assume ~n#1 < 2; 71260#merge_sortFINAL assume true; 71256#merge_sortEXIT >#85#return; 71254#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 71297#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 71301#L24 assume ~n#1 < 2; 71298#merge_sortFINAL assume true; 71295#merge_sortEXIT >#87#return; 71294#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 71293#L11-3 assume merge_~k~0#1 < merge_~n#1; 71292#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 71291#L12 assume !(merge_~j~0#1 == merge_~n#1); 71290#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 71287#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 71285#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 71283#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 71281#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 71279#L11-3 assume merge_~k~0#1 < merge_~n#1; 71277#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 71275#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 71274#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 71273#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 71272#L11-4 merge_~i~0#1 := 0; 71271#L17-3 assume merge_~i~0#1 < merge_~n#1; 71270#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 71269#L17-3 assume merge_~i~0#1 < merge_~n#1; 71268#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 71267#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 71266#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 71264#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 71261#merge_sortFINAL assume true; 71258#merge_sortEXIT >#85#return; 71250#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 71252#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 71388#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 71378#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 71380#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 71386#L24 assume ~n#1 < 2; 71385#merge_sortFINAL assume true; 71377#merge_sortEXIT >#85#return; 71367#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 71369#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 71387#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 71379#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 71380#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 71386#L24 assume ~n#1 < 2; 71385#merge_sortFINAL assume true; 71377#merge_sortEXIT >#85#return; 71366#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 71376#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 71381#L24 assume ~n#1 < 2; 71375#merge_sortFINAL assume true; 71365#merge_sortEXIT >#87#return; 71368#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 71669#L11-3 assume merge_~k~0#1 < merge_~n#1; 71665#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 71666#L12 assume !(merge_~j~0#1 == merge_~n#1); 71661#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 71662#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 71656#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 71657#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 71652#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 71653#L11-3 assume merge_~k~0#1 < merge_~n#1; 71648#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 71649#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 71721#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 71720#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 71719#L11-4 merge_~i~0#1 := 0; 71718#L17-3 assume merge_~i~0#1 < merge_~n#1; 71717#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 71716#L17-3 assume merge_~i~0#1 < merge_~n#1; 71715#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 71714#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 71713#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 71712#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 71711#merge_sortFINAL assume true; 71710#merge_sortEXIT >#87#return; 71709#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 71708#L11-3 assume merge_~k~0#1 < merge_~n#1; 71707#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 71705#L12 assume !(merge_~j~0#1 == merge_~n#1); 71702#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 71699#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 71697#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 71695#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 71692#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 71690#L11-3 assume merge_~k~0#1 < merge_~n#1; 71688#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 71686#L12 assume !(merge_~j~0#1 == merge_~n#1); 71684#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 71681#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 71678#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 71676#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 71677#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 71768#L11-3 assume merge_~k~0#1 < merge_~n#1; 71767#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 71766#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 71639#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 71640#L11-3 assume merge_~k~0#1 < merge_~n#1; 71670#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 71643#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 71644#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 71637#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 71638#L11-4 merge_~i~0#1 := 0; 72061#L17-3 assume merge_~i~0#1 < merge_~n#1; 72058#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 72055#L17-3 assume merge_~i~0#1 < merge_~n#1; 72052#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 72049#L17-3 assume merge_~i~0#1 < merge_~n#1; 72044#L17-1
[2024-11-08 17:45:37,050 INFO L747 eck$LassoCheckResult]: Loop: 72044#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 72043#L17-3 assume merge_~i~0#1 < merge_~n#1; 72044#L17-1
[2024-11-08 17:45:37,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash -571582827, now seen corresponding path program 23 times
[2024-11-08 17:45:37,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:37,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873952183]
[2024-11-08 17:45:37,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-08 17:45:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:37,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:37,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:37,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 17:45:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:37,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65
[2024-11-08 17:45:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:37,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:37,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 152 proven. 131 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked.
[2024-11-08 17:45:37,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:45:37,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873952183]
[2024-11-08 17:45:37,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873952183] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:45:37,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911036425]
[2024-11-08 17:45:37,939 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-08 17:45:37,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:45:37,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:37,942 INFO L229 MonitoredProcess]: Starting monitored process 141 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:45:37,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process
[2024-11-08 17:45:40,299 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s)
[2024-11-08 17:45:40,299 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:45:40,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-08 17:45:40,309 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:45:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 150 proven. 29 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked.
[2024-11-08 17:45:40,641 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:45:40,915 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 150 proven. 15 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked.
[2024-11-08 17:45:40,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911036425] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:45:40,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:45:40,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 9] total 32
[2024-11-08 17:45:40,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232300592]
[2024-11-08 17:45:40,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:45:40,916 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:45:40,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2556, now seen corresponding path program 6 times
[2024-11-08 17:45:40,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:40,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266012332]
[2024-11-08 17:45:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:40,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:40,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:45:40,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:40,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:45:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:45:41,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-11-08 17:45:41,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992
[2024-11-08 17:45:41,059 INFO L87 Difference]: Start difference. First operand 2200 states and 2556 transitions. cyclomatic complexity: 411 Second operand has 32 states, 30 states have (on average 4.066666666666666) internal successors, (122), 27 states have internal predecessors, (122), 7 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9)
[2024-11-08 17:45:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:45:42,120 INFO L93 Difference]: Finished difference Result 2227 states and 2576 transitions.
[2024-11-08 17:45:42,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2227 states and 2576 transitions.
[2024-11-08 17:45:42,131 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 26
[2024-11-08 17:45:42,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2227 states to 2225 states and 2572 transitions.
[2024-11-08 17:45:42,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 778
[2024-11-08 17:45:42,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 952
[2024-11-08 17:45:42,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2225 states and 2572 transitions.
[2024-11-08 17:45:42,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:45:42,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2225 states and 2572 transitions.
[2024-11-08 17:45:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states and 2572 transitions.
[2024-11-08 17:45:42,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2209.
[2024-11-08 17:45:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 2140 states have (on average 1.1378504672897196) internal successors, (2435), 2131 states have internal predecessors, (2435), 45 states have call successors, (46), 25 states have call predecessors, (46), 24 states have return successors, (75), 52 states have call predecessors, (75), 40 states have call successors, (75)
[2024-11-08 17:45:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 2556 transitions.
[2024-11-08 17:45:42,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2209 states and 2556 transitions.
[2024-11-08 17:45:42,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states.
[2024-11-08 17:45:42,200 INFO L425 stractBuchiCegarLoop]: Abstraction has 2209 states and 2556 transitions.
[2024-11-08 17:45:42,200 INFO L332 stractBuchiCegarLoop]: ======== Iteration 34 ============
[2024-11-08 17:45:42,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2209 states and 2556 transitions.
[2024-11-08 17:45:42,212 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 26
[2024-11-08 17:45:42,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:45:42,213 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:45:42,214 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 11, 11, 11, 10, 9, 9, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:45:42,215 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 17:45:42,215 INFO L745 eck$LassoCheckResult]: Stem: 76554#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 76498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 76499#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 76512#L40-3 assume main_~i~1#1 < main_~n~0#1; 76513#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 76514#L40-3 assume main_~i~1#1 < main_~n~0#1; 76515#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 76570#L40-3 assume main_~i~1#1 < main_~n~0#1; 76569#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 76568#L40-3 assume main_~i~1#1 < main_~n~0#1; 76567#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 76566#L40-3 assume main_~i~1#1 < main_~n~0#1; 76565#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 76564#L40-3 assume main_~i~1#1 < main_~n~0#1; 76563#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 76562#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 76553#L40-4 havoc main_~i~1#1; 76476#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 76477#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 76636#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 76574#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 76633#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 76631#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 76627#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 76628#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 76533#L24 assume ~n#1 < 2; 76630#merge_sortFINAL assume true; 76626#merge_sortEXIT >#85#return; 76622#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 76623#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 76672#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 76668#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 76669#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 76673#L24 assume ~n#1 < 2; 76671#merge_sortFINAL assume true; 76667#merge_sortEXIT >#85#return; 76664#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 76665#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 76670#L24 assume ~n#1 < 2; 76666#merge_sortFINAL assume true; 76663#merge_sortEXIT >#87#return; 76662#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 76661#L11-3 assume merge_~k~0#1 < merge_~n#1; 76660#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 76659#L12 assume !(merge_~j~0#1 == merge_~n#1); 76658#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 76656#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 76654#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 76652#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 76650#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 76648#L11-3 assume merge_~k~0#1 < merge_~n#1; 76646#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 76644#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 76642#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 76641#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 76640#L11-4 merge_~i~0#1 := 0; 76639#L17-3 assume merge_~i~0#1 < merge_~n#1; 76638#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 76637#L17-3 assume merge_~i~0#1 < merge_~n#1; 76635#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 76634#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 76632#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 76629#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 76625#merge_sortFINAL assume true; 76621#merge_sortEXIT >#87#return; 76620#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 76619#L11-3 assume merge_~k~0#1 < merge_~n#1; 76618#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 76617#L12 assume !(merge_~j~0#1 == merge_~n#1); 76616#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 76614#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 76615#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 76613#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 76611#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 76609#L11-3 assume merge_~k~0#1 < merge_~n#1; 76606#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 76604#L12 assume !(merge_~j~0#1 == merge_~n#1); 76602#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 76599#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 76600#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 76980#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 76976#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 76972#L11-3 assume merge_~k~0#1 < merge_~n#1; 76968#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 76964#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 76959#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 76956#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 76955#L11-4 merge_~i~0#1 := 0; 76954#L17-3 assume merge_~i~0#1 < merge_~n#1; 76953#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 76951#L17-3 assume merge_~i~0#1 < merge_~n#1; 76949#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 76947#L17-3 assume merge_~i~0#1 < merge_~n#1; 76945#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 76943#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 76939#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 76937#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 76935#merge_sortFINAL assume true; 76933#merge_sortEXIT >#85#return; 76886#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 76897#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 77339#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 76546#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 76849#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 76541#L24 assume ~n#1 < 2; 76548#merge_sortFINAL assume true; 76860#merge_sortEXIT >#85#return; 76854#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 76879#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 76870#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 76547#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 76849#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 76541#L24 assume ~n#1 < 2; 76548#merge_sortFINAL assume true; 76860#merge_sortEXIT >#85#return; 76545#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 76849#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 76541#L24 assume ~n#1 < 2; 76548#merge_sortFINAL assume true; 76860#merge_sortEXIT >#87#return; 76861#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 76932#L11-3 assume merge_~k~0#1 < merge_~n#1; 76931#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 76930#L12 assume !(merge_~j~0#1 == merge_~n#1); 76929#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 76926#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 76924#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 76922#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 76920#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 76918#L11-3 assume merge_~k~0#1 < merge_~n#1; 76916#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 76914#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 76913#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 76912#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 76911#L11-4 merge_~i~0#1 := 0; 76910#L17-3 assume merge_~i~0#1 < merge_~n#1; 76909#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 76908#L17-3 assume merge_~i~0#1 < merge_~n#1; 76907#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 76906#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 76905#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 76904#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 76903#merge_sortFINAL assume true; 76898#merge_sortEXIT >#87#return; 76902#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 77334#L11-3 assume merge_~k~0#1 < merge_~n#1; 77332#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 77330#L12 assume !(merge_~j~0#1 == merge_~n#1); 77328#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 77326#L14 assume !(merge_#t~mem6#1 < merge_#t~mem7#1);merge_#t~post10#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post10#1;call merge_#t~mem11#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post10#1, 4);merge_#t~ite12#1 := merge_#t~mem11#1; 77321#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 77317#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 77313#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 77308#L11-3 assume merge_~k~0#1 < merge_~n#1; 77304#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 77300#L12 assume !(merge_~j~0#1 == merge_~n#1); 77295#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 77289#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 77286#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 77283#L11-3 assume merge_~k~0#1 < merge_~n#1; 77280#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 77277#L12 assume !(merge_~j~0#1 == merge_~n#1); 77274#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post4#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post4#1;call merge_#t~mem5#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post4#1, 4);merge_#t~ite13#1 := merge_#t~mem5#1; 77271#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 77268#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 77266#L11-3 assume merge_~k~0#1 < merge_~n#1; 77264#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 77262#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 77260#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 77258#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 77254#L11-4 merge_~i~0#1 := 0; 77251#L17-3 assume merge_~i~0#1 < merge_~n#1; 77248#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 77241#L17-3 assume merge_~i~0#1 < merge_~n#1; 77235#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 77221#L17-3 assume merge_~i~0#1 < merge_~n#1; 77207#L17-1
[2024-11-08 17:45:42,216 INFO L747 eck$LassoCheckResult]: Loop: 77207#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 77208#L17-3 assume merge_~i~0#1 < merge_~n#1; 77207#L17-1
[2024-11-08 17:45:42,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1934402718, now seen corresponding path program 2 times
[2024-11-08 17:45:42,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:42,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251093510]
[2024-11-08 17:45:42,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:42,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:43,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-08 17:45:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:43,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:43,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:43,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:43,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102
[2024-11-08 17:45:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:43,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107
[2024-11-08 17:45:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:43,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:43,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 163 proven. 393 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked.
[2024-11-08 17:45:43,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:45:43,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251093510]
[2024-11-08 17:45:43,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251093510] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:45:43,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876052356]
[2024-11-08 17:45:43,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 17:45:43,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:45:43,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:43,873 INFO L229 MonitoredProcess]: Starting monitored process 142 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:45:43,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process
[2024-11-08 17:45:44,357 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 17:45:44,357 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:45:44,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 27 conjuncts are in the unsatisfiable core
[2024-11-08 17:45:44,363 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:45:44,775 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 283 proven. 222 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked.
[2024-11-08 17:45:44,775 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:45:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 313 proven. 192 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked.
[2024-11-08 17:45:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876052356] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:45:45,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:45:45,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24, 24] total 43
[2024-11-08 17:45:45,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196191436]
[2024-11-08 17:45:45,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:45:45,385 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:45:45,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2556, now seen corresponding path program 7 times
[2024-11-08 17:45:45,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:45,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448098615]
[2024-11-08 17:45:45,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:45,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:45,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:45:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:45,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:45:45,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:45:45,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2024-11-08 17:45:45,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1615, Unknown=0, NotChecked=0, Total=1806
[2024-11-08 17:45:45,502 INFO L87 Difference]: Start difference. First operand 2209 states and 2556 transitions. cyclomatic complexity: 397 Second operand has 43 states, 40 states have (on average 4.7) internal successors, (188), 37 states have internal predecessors, (188), 10 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14)
[2024-11-08 17:45:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:45:47,362 INFO L93 Difference]: Finished difference Result 2506 states and 2873 transitions.
[2024-11-08 17:45:47,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2506 states and 2873 transitions.
[2024-11-08 17:45:47,374 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 26
[2024-11-08 17:45:47,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2506 states to 2264 states and 2615 transitions.
[2024-11-08 17:45:47,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 922
[2024-11-08 17:45:47,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 922
[2024-11-08 17:45:47,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2264 states and 2615 transitions.
[2024-11-08 17:45:47,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:45:47,392 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2264 states and 2615 transitions.
[2024-11-08 17:45:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states and 2615 transitions.
[2024-11-08 17:45:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2195.
[2024-11-08 17:45:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2195 states, 2131 states have (on average 1.1374941342092915) internal successors, (2424), 2122 states have internal predecessors, (2424), 40 states have call successors, (41), 21 states have call predecessors, (41), 24 states have return successors, (72), 51 states have call predecessors, (72), 37 states have call successors, (72)
[2024-11-08 17:45:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 2537 transitions.
[2024-11-08 17:45:47,430 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2195 states and 2537 transitions.
[2024-11-08 17:45:47,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states.
[2024-11-08 17:45:47,431 INFO L425 stractBuchiCegarLoop]: Abstraction has 2195 states and 2537 transitions.
[2024-11-08 17:45:47,431 INFO L332 stractBuchiCegarLoop]: ======== Iteration 35 ============
[2024-11-08 17:45:47,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2195 states and 2537 transitions.
[2024-11-08 17:45:47,440 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 26
[2024-11-08 17:45:47,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:45:47,440 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:45:47,441 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:45:47,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-08 17:45:47,442 INFO L745 eck$LassoCheckResult]: Stem: 82620#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 82567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 82568#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 82575#L40-3 assume main_~i~1#1 < main_~n~0#1; 82576#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 82577#L40-3 assume main_~i~1#1 < main_~n~0#1; 82578#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 82634#L40-3 assume main_~i~1#1 < main_~n~0#1; 82633#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 82632#L40-3 assume main_~i~1#1 < main_~n~0#1; 82631#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 82630#L40-3 assume main_~i~1#1 < main_~n~0#1; 82629#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 82628#L40-3 assume main_~i~1#1 < main_~n~0#1; 82627#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 82626#L40-3 assume main_~i~1#1 < main_~n~0#1; 82624#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 82623#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 82616#L40-4 havoc main_~i~1#1; 82545#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 82546#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82625#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 82548#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 82591#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82597#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 82549#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 82591#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82597#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 82549#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 82591#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82597#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 82549#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 82591#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82596#L24 assume ~n#1 < 2; 82690#merge_sortFINAL assume true; 82688#merge_sortEXIT >#85#return; 82684#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 82686#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82845#L24 assume ~n#1 < 2; 82843#merge_sortFINAL assume true; 82838#merge_sortEXIT >#87#return; 82831#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 82825#L11-3 assume merge_~k~0#1 < merge_~n#1; 82823#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 82821#L12 assume !(merge_~j~0#1 == merge_~n#1); 82819#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 82815#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 82812#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 82807#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 82803#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 82799#L11-3 assume merge_~k~0#1 < merge_~n#1; 82795#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 82791#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 82788#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 82785#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 82783#L11-4 merge_~i~0#1 := 0; 82781#L17-3 assume merge_~i~0#1 < merge_~n#1; 82779#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 82777#L17-3 assume merge_~i~0#1 < merge_~n#1; 82775#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 82773#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 82771#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 82769#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 82767#merge_sortFINAL assume true; 82765#merge_sortEXIT >#85#return; 82613#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 82763#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82842#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 82836#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 82837#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82841#L24 assume ~n#1 < 2; 82840#merge_sortFINAL assume true; 82834#merge_sortEXIT >#85#return; 82827#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 82830#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82844#L24 assume ~n#1 < 2; 82832#merge_sortFINAL assume true; 82826#merge_sortEXIT >#87#return; 82824#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 82822#L11-3 assume merge_~k~0#1 < merge_~n#1; 82820#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 82818#L12 assume !(merge_~j~0#1 == merge_~n#1); 82814#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 82809#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 82805#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 82801#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 82797#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 82793#L11-3 assume merge_~k~0#1 < merge_~n#1; 82789#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 82786#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 82784#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 82782#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 82780#L11-4 merge_~i~0#1 := 0; 82778#L17-3 assume merge_~i~0#1 < merge_~n#1; 82776#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 82774#L17-3 assume merge_~i~0#1 < merge_~n#1; 82772#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 82770#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 82768#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 82766#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 82764#merge_sortFINAL assume true; 82762#merge_sortEXIT >#87#return; 82761#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 82760#L11-3 assume merge_~k~0#1 < merge_~n#1; 82759#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 82758#L12 assume !(merge_~j~0#1 == merge_~n#1); 82757#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 82755#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 82754#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 82753#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 82751#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 82750#L11-3 assume merge_~k~0#1 < merge_~n#1; 82749#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 82748#L12 assume !(merge_~j~0#1 == merge_~n#1); 82747#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 82745#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 82744#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 82743#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 82742#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 82741#L11-3 assume merge_~k~0#1 < merge_~n#1; 82740#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 82736#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 82737#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 82644#L11-3 assume merge_~k~0#1 < merge_~n#1; 82733#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 82646#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 82642#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 82643#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 82637#L11-4 merge_~i~0#1 := 0; 82635#L17-3 assume merge_~i~0#1 < merge_~n#1; 82636#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 82604#L17-3 assume merge_~i~0#1 < merge_~n#1; 82571#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 82572#L17-3 assume merge_~i~0#1 < merge_~n#1; 83070#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 83069#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 83067#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 83065#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 83063#merge_sortFINAL assume true; 83061#merge_sortEXIT >#85#return; 82556#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 82601#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82893#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 82894#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 82590#$Ultimate##0
[2024-11-08 17:45:47,442 INFO L747 eck$LassoCheckResult]: Loop: 82590#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 82916#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 82904#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 82590#$Ultimate##0
[2024-11-08 17:45:47,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash 935554403, now seen corresponding path program 24 times
[2024-11-08 17:45:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:47,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432002510]
[2024-11-08 17:45:47,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:47,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:48,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25
[2024-11-08 17:45:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:48,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:49,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:49,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:49,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39
[2024-11-08 17:45:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:49,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 17:45:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:49,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-11-08 17:45:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:45:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 63 proven. 238 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked.
[2024-11-08 17:45:49,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:45:49,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432002510]
[2024-11-08 17:45:49,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432002510] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 17:45:49,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103919268]
[2024-11-08 17:45:49,154 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-11-08 17:45:49,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:45:49,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:45:49,156 INFO L229 MonitoredProcess]: Starting monitored process 143 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:45:49,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59e663ad-43db-4765-a6b4-a2d6e4bd5d70/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process
[2024-11-08 17:45:50,520 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s)
[2024-11-08 17:45:50,520 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:45:50,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 20 conjuncts are in the unsatisfiable core
[2024-11-08 17:45:50,528 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:45:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 141 proven. 145 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked.
[2024-11-08 17:45:50,874 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 17:45:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 146 proven. 140 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked.
[2024-11-08 17:45:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103919268] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 17:45:51,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 17:45:51,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 15, 15] total 42
[2024-11-08 17:45:51,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816250723]
[2024-11-08 17:45:51,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 17:45:51,388 INFO L750 eck$LassoCheckResult]: stem already infeasible
[2024-11-08 17:45:51,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:51,388 INFO L85 PathProgramCache]: Analyzing trace with hash 29999, now seen corresponding path program 8 times
[2024-11-08 17:45:51,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:51,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417385238]
[2024-11-08 17:45:51,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:51,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:51,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:45:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:51,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:45:51,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:45:51,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-11-08 17:45:51,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1553, Unknown=0, NotChecked=0, Total=1722
[2024-11-08 17:45:51,597 INFO L87 Difference]: Start difference. First operand 2195 states and 2537 transitions. cyclomatic complexity: 392 Second operand has 42 states, 40 states have (on average 3.75) internal successors, (150), 37 states have internal predecessors, (150), 9 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13)
[2024-11-08 17:45:56,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 17:45:56,545 INFO L93 Difference]: Finished difference Result 4722 states and 5522 transitions.
[2024-11-08 17:45:56,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4722 states and 5522 transitions.
[2024-11-08 17:45:56,568 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 62
[2024-11-08 17:45:56,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4722 states to 4662 states and 5455 transitions.
[2024-11-08 17:45:56,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1604
[2024-11-08 17:45:56,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1604
[2024-11-08 17:45:56,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4662 states and 5455 transitions.
[2024-11-08 17:45:56,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 17:45:56,603 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4662 states and 5455 transitions.
[2024-11-08 17:45:56,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4662 states and 5455 transitions.
[2024-11-08 17:45:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4662 to 2837.
[2024-11-08 17:45:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2837 states, 2748 states have (on average 1.1295487627365357) internal successors, (3104), 2736 states have internal predecessors, (3104), 59 states have call successors, (60), 29 states have call predecessors, (60), 30 states have return successors, (94), 71 states have call predecessors, (94), 54 states have call successors, (94)
[2024-11-08 17:45:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 3258 transitions.
[2024-11-08 17:45:56,673 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2837 states and 3258 transitions.
[2024-11-08 17:45:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states.
[2024-11-08 17:45:56,673 INFO L425 stractBuchiCegarLoop]: Abstraction has 2837 states and 3258 transitions.
[2024-11-08 17:45:56,674 INFO L332 stractBuchiCegarLoop]: ======== Iteration 36 ============
[2024-11-08 17:45:56,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2837 states and 3258 transitions.
[2024-11-08 17:45:56,687 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 34
[2024-11-08 17:45:56,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 17:45:56,688 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 17:45:56,689 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 8, 8, 8, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:45:56,689 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-08 17:45:56,690 INFO L745 eck$LassoCheckResult]: Stem: 90899#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 90843#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~malloc19#1.base, main_#t~malloc19#1.offset, main_#t~nondet20#1, main_#t~post21#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;havoc main_#t~nondet18#1;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 90844#L35 assume !(main_~n~0#1 < 1);call main_#t~malloc19#1.base, main_#t~malloc19#1.offset := #Ultimate.allocOnHeap(4 * main_~n~0#1 % 18446744073709551616);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc19#1.base, main_#t~malloc19#1.offset;havoc main_#t~malloc19#1.base, main_#t~malloc19#1.offset;main_~i~1#1 := 0; 90855#L40-3 assume main_~i~1#1 < main_~n~0#1; 90856#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 90857#L40-3 assume main_~i~1#1 < main_~n~0#1; 90858#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 90894#L40-3 assume main_~i~1#1 < main_~n~0#1; 90915#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 90914#L40-3 assume main_~i~1#1 < main_~n~0#1; 90913#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 90912#L40-3 assume main_~i~1#1 < main_~n~0#1; 90911#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 90910#L40-3 assume main_~i~1#1 < main_~n~0#1; 90909#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 90907#L40-3 assume main_~i~1#1 < main_~n~0#1; 90908#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 90904#L40-3 assume main_~i~1#1 < main_~n~0#1; 90905#L40-1 assume !!(main_~i~1#1 < main_~n~0#1);havoc main_#t~nondet20#1;call write~int#1(main_#t~nondet20#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet20#1;main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; 90906#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 90895#L40-4 havoc main_~i~1#1; 90870#L44 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 90916#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 90917#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 90825#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 90871#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 90939#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 90824#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 90871#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 90939#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 90824#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 90871#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 90881#L24 assume ~n#1 < 2; 90938#merge_sortFINAL assume true; 90930#merge_sortEXIT >#85#return; 90875#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 90874#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 90876#L24 assume ~n#1 < 2; 91423#merge_sortFINAL assume true; 91418#merge_sortEXIT >#87#return; 91415#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 91411#L11-3 assume merge_~k~0#1 < merge_~n#1; 91407#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 91406#L12 assume !(merge_~j~0#1 == merge_~n#1); 91401#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 91394#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 91389#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 91384#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 91379#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 91374#L11-3 assume merge_~k~0#1 < merge_~n#1; 91369#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 91364#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 91361#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 91358#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 91355#L11-4 merge_~i~0#1 := 0; 91352#L17-3 assume merge_~i~0#1 < merge_~n#1; 91349#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 91346#L17-3 assume merge_~i~0#1 < merge_~n#1; 91343#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 91340#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 91338#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 91334#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 91332#merge_sortFINAL assume true; 91330#merge_sortEXIT >#85#return; 90863#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 90885#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 90918#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 90919#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 90922#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 90992#L24 assume ~n#1 < 2; 90941#merge_sortFINAL assume true; 90942#merge_sortEXIT >#85#return; 90923#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 90994#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 90993#L24 assume ~n#1 < 2; 90889#merge_sortFINAL assume true; 91548#merge_sortEXIT >#87#return; 91547#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 91546#L11-3 assume merge_~k~0#1 < merge_~n#1; 91545#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 91544#L12 assume !(merge_~j~0#1 == merge_~n#1); 91543#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 91540#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 91538#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 91536#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 91534#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 91532#L11-3 assume merge_~k~0#1 < merge_~n#1; 91530#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 91528#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 91527#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 91526#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 91525#L11-4 merge_~i~0#1 := 0; 91524#L17-3 assume merge_~i~0#1 < merge_~n#1; 91523#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 91522#L17-3 assume merge_~i~0#1 < merge_~n#1; 91521#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 91520#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 91519#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 91518#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 91517#merge_sortFINAL assume true; 91516#merge_sortEXIT >#87#return; 91515#L28 assume { :begin_inline_merge } true;merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1 := ~a#1.base, ~a#1.offset, ~n#1, ~m~0#1;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;merge_~a#1.base, merge_~a#1.offset := merge_#in~a#1.base, merge_#in~a#1.offset;merge_~n#1 := merge_#in~n#1;merge_~m#1 := merge_#in~m#1;havoc merge_~i~0#1;havoc merge_~j~0#1;havoc merge_~k~0#1;call merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset := #Ultimate.allocOnHeap(4 * merge_~n#1 % 18446744073709551616);merge_~x~0#1.base, merge_~x~0#1.offset := merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset;merge_~i~0#1 := 0;merge_~j~0#1 := merge_~m#1;merge_~k~0#1 := 0; 91514#L11-3 assume merge_~k~0#1 < merge_~n#1; 91513#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 91512#L12 assume !(merge_~j~0#1 == merge_~n#1); 91511#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 91509#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 91508#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 91507#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 91506#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 91505#L11-3 assume merge_~k~0#1 < merge_~n#1; 91504#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 91503#L12 assume !(merge_~j~0#1 == merge_~n#1); 91502#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem6#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem7#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 91500#L14 assume merge_#t~mem6#1 < merge_#t~mem7#1;merge_#t~post8#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post8#1;call merge_#t~mem9#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post8#1, 4);merge_#t~ite12#1 := merge_#t~mem9#1; 91499#L14-2 merge_#t~ite13#1 := merge_#t~ite12#1; 91498#L13-2 merge_#t~ite14#1 := merge_#t~ite13#1; 91497#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 91496#L11-3 assume merge_~k~0#1 < merge_~n#1; 91495#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 91492#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 91493#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 91483#L11-3 assume merge_~k~0#1 < merge_~n#1; 91487#L11-1 assume !!(merge_~k~0#1 < merge_~n#1); 91484#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post2#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post2#1;call merge_#t~mem3#1 := read~int#1(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post2#1, 4);merge_#t~ite14#1 := merge_#t~mem3#1; 91482#L12-2 call write~int#0(merge_#t~ite14#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite14#1;havoc merge_#t~post2#1;havoc merge_#t~mem3#1;havoc merge_#t~ite13#1;havoc merge_#t~post4#1;havoc merge_#t~mem5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~ite12#1;havoc merge_#t~post8#1;havoc merge_#t~mem9#1;havoc merge_#t~post10#1;havoc merge_#t~mem11#1;merge_#t~post15#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post15#1;havoc merge_#t~post15#1; 91478#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 90921#L11-4 merge_~i~0#1 := 0; 90920#L17-3 assume merge_~i~0#1 < merge_~n#1; 90848#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 90849#L17-3 assume merge_~i~0#1 < merge_~n#1; 90886#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 91477#L17-3 assume merge_~i~0#1 < merge_~n#1; 91476#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 91475#L17-3 assume merge_~i~0#1 < merge_~n#1; 91325#L17-1 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem16#1 := read~int#0(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int#1(merge_#t~mem16#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem16#1;merge_#t~post17#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post17#1;havoc merge_#t~post17#1; 91324#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 91322#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 91320#L8 havoc merge_#t~malloc1#1.base, merge_#t~malloc1#1.offset, merge_#t~ite14#1, merge_#t~post2#1, merge_#t~mem3#1, merge_#t~ite13#1, merge_#t~post4#1, merge_#t~mem5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~ite12#1, merge_#t~post8#1, merge_#t~mem9#1, merge_#t~post10#1, merge_#t~mem11#1, merge_#t~post15#1, merge_#t~mem16#1, merge_#t~post17#1, merge_~a#1.base, merge_~a#1.offset, merge_~n#1, merge_~m#1, merge_~i~0#1, merge_~j~0#1, merge_~k~0#1, merge_~x~0#1.base, merge_~x~0#1.offset;havoc merge_#in~a#1.base, merge_#in~a#1.offset, merge_#in~n#1, merge_#in~m#1;assume { :end_inline_merge } true; 91318#merge_sortFINAL assume true; 91316#merge_sortEXIT >#85#return; 90830#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 90999#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 91000#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 90962#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 90977#$Ultimate##0
[2024-11-08 17:45:56,690 INFO L747 eck$LassoCheckResult]: Loop: 90977#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 90975#L24 assume !(~n#1 < 2);~m~0#1 := (if ~n#1 < 0 && 0 != ~n#1 % 2 then 1 + ~n#1 / 2 else ~n#1 / 2); 90950#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 90977#$Ultimate##0
[2024-11-08 17:45:56,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash 546005385, now seen corresponding path program 25 times
[2024-11-08 17:45:56,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:56,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325962890]
[2024-11-08 17:45:56,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:56,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:45:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:56,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:45:56,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash 29999, now seen corresponding path program 9 times
[2024-11-08 17:45:56,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:56,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779400268]
[2024-11-08 17:45:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:56,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:56,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:45:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:56,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:45:56,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:45:56,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1005274791, now seen corresponding path program 26 times
[2024-11-08 17:45:56,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:45:56,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315011240]
[2024-11-08 17:45:56,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:45:56,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:45:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:57,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:45:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:45:57,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:47:19,862 WARN L286 SmtUtils]: Spent 1.25m on a formula simplification. DAG size of input: 460 DAG size of output: 375 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2024-11-08 17:47:45,294 WARN L286 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 215 DAG size of output: 213 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2024-11-08 17:48:04,569 WARN L286 SmtUtils]: Spent 10.83s on a formula simplification. DAG size of input: 214 DAG size of output: 213 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2024-11-08 17:48:20,632 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 194 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)
[2024-11-08 17:48:42,301 WARN L286 SmtUtils]: Spent 14.06s on a formula simplification. DAG size of input: 242 DAG size of output: 229 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)