./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 2329fc70 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_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 17:41:09,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:41:09,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:41:09,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:41:09,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:41:09,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:41:09,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:41:09,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:41:09,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:41:09,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:41:09,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:41:09,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:41:09,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:41:09,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:41:09,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:41:09,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:41:09,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:41:09,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:41:09,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:41:09,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:41:09,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:41:09,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:41:09,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:41:09,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:41:09,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:41:09,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:41:09,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:41:09,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:41:09,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:41:09,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:41:09,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:41:09,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:41:09,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:41:09,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:41:09,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:41:09,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:41:09,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:41:09,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:41:09,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:41:09,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:41:09,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:41:09,978 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-12-13 17:41:09,992 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:41:09,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:41:09,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:41:09,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:41:09,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:41:09,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:41:09,993 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:41:09,993 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 17:41:09,994 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 17:41:09,994 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 17:41:09,994 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 17:41:09,994 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 17:41:09,994 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 17:41:09,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:41:09,994 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 17:41:09,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:41:09,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:41:09,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 17:41:09,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 17:41:09,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 17:41:09,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:41:09,995 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 17:41:09,995 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:41:09,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 17:41:09,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:41:09,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:41:09,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:41:09,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:41:09,996 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 17:41:09,996 INFO L138 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_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/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_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2022-12-13 17:41:10,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:41:10,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:41:10,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:41:10,169 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:41:10,169 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:41:10,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2022-12-13 17:41:12,680 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:41:12,863 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:41:12,863 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/sv-benchmarks/c/termination-recursive-malloc/mergeSort.i [2022-12-13 17:41:12,868 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/data/bc50eb460/2de8540c4ec541a396ca7953cf79c92b/FLAG2617da08c [2022-12-13 17:41:13,259 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/data/bc50eb460/2de8540c4ec541a396ca7953cf79c92b [2022-12-13 17:41:13,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:41:13,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:41:13,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:41:13,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:41:13,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:41:13,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:41:13" (1/1) ... [2022-12-13 17:41:13,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d679ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13, skipping insertion in model container [2022-12-13 17:41:13,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:41:13" (1/1) ... [2022-12-13 17:41:13,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:41:13,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:41:13,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:41:13,424 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:41:13,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:41:13,455 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:41:13,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13 WrapperNode [2022-12-13 17:41:13,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:41:13,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:41:13,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:41:13,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:41:13,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13" (1/1) ... [2022-12-13 17:41:13,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13" (1/1) ... [2022-12-13 17:41:13,488 INFO L138 Inliner]: procedures = 12, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2022-12-13 17:41:13,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:41:13,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:41:13,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:41:13,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:41:13,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13" (1/1) ... [2022-12-13 17:41:13,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13" (1/1) ... [2022-12-13 17:41:13,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13" (1/1) ... [2022-12-13 17:41:13,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13" (1/1) ... [2022-12-13 17:41:13,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13" (1/1) ... [2022-12-13 17:41:13,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13" (1/1) ... [2022-12-13 17:41:13,511 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13" (1/1) ... [2022-12-13 17:41:13,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13" (1/1) ... [2022-12-13 17:41:13,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:41:13,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:41:13,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:41:13,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:41:13,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13" (1/1) ... [2022-12-13 17:41:13,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:13,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:13,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:13,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 17:41:13,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 17:41:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure merge_sort [2022-12-13 17:41:13,584 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_sort [2022-12-13 17:41:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 17:41:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:41:13,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:41:13,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 17:41:13,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:41:13,656 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:41:13,658 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:41:13,826 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:41:13,832 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:41:13,832 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 17:41:13,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:41:13 BoogieIcfgContainer [2022-12-13 17:41:13,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:41:13,835 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 17:41:13,836 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 17:41:13,839 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 17:41:13,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 17:41:13,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 05:41:13" (1/3) ... [2022-12-13 17:41:13,841 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b44b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 05:41:13, skipping insertion in model container [2022-12-13 17:41:13,842 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 17:41:13,842 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:41:13" (2/3) ... [2022-12-13 17:41:13,842 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b44b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 05:41:13, skipping insertion in model container [2022-12-13 17:41:13,842 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 17:41:13,842 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:41:13" (3/3) ... [2022-12-13 17:41:13,844 INFO L332 chiAutomizerObserver]: Analyzing ICFG mergeSort.i [2022-12-13 17:41:13,897 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 17:41:13,897 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 17:41:13,897 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 17:41:13,898 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 17:41:13,898 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 17:41:13,898 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 17:41:13,898 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 17:41:13,898 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 17:41:13,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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) [2022-12-13 17:41:13,919 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-12-13 17:41:13,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:13,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:13,923 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-12-13 17:41:13,923 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 17:41:13,924 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 17:41:13,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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) [2022-12-13 17:41:13,926 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-12-13 17:41:13,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:13,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:13,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-12-13 17:41:13,927 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 17:41:13,932 INFO L748 eck$LassoCheckResult]: Stem: 28#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 15#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; 9#L40-3true [2022-12-13 17:41:13,933 INFO L750 eck$LassoCheckResult]: Loop: 9#L40-3true assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 10#L40-2true main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 9#L40-3true [2022-12-13 17:41:13,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash 89440, now seen corresponding path program 1 times [2022-12-13 17:41:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:13,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277419992] [2022-12-13 17:41:13,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:13,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:14,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:14,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:14,074 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2022-12-13 17:41:14,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:14,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805522061] [2022-12-13 17:41:14,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:14,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:14,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:14,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:14,096 INFO L85 PathProgramCache]: Analyzing trace with hash 85954242, now seen corresponding path program 1 times [2022-12-13 17:41:14,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:14,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281601451] [2022-12-13 17:41:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:14,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:14,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:14,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:14,313 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 17:41:14,314 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 17:41:14,314 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 17:41:14,314 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 17:41:14,314 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 17:41:14,314 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:14,314 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 17:41:14,315 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 17:41:14,315 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration1_Lasso [2022-12-13 17:41:14,315 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 17:41:14,315 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 17:41:14,334 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:14,343 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:14,348 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:14,350 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:14,352 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:14,354 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:14,357 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:14,359 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:14,602 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 17:41:14,605 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 17:41:14,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:14,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:14,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:14,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-12-13 17:41:14,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 [2022-12-13 17:41:14,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:14,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:14,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:14,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:14,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:14,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:14,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:14,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:14,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:14,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:14,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:14,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:14,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-12-13 17:41:14,633 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 [2022-12-13 17:41:14,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:14,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:14,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:14,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:14,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:14,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:14,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:14,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:14,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:14,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:14,655 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:14,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-12-13 17:41:14,657 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 [2022-12-13 17:41:14,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:14,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:14,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:14,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:14,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:14,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:14,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:14,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:14,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-12-13 17:41:14,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:14,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:14,674 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:14,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-12-13 17:41:14,676 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 [2022-12-13 17:41:14,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:14,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:14,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:14,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:14,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:14,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:14,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:14,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:14,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-12-13 17:41:14,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:14,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:14,693 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:14,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-12-13 17:41:14,695 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 [2022-12-13 17:41:14,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:14,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:14,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:14,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:14,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:14,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:14,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:14,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:14,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-12-13 17:41:14,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:14,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:14,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:14,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-12-13 17:41:14,715 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 [2022-12-13 17:41:14,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:14,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:14,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:14,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:14,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:14,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:14,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:14,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-12-13 17:41:14,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:14,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:14,737 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:14,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-12-13 17:41:14,739 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 [2022-12-13 17:41:14,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:14,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:14,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:14,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:14,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:14,750 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:14,750 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:14,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:14,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-12-13 17:41:14,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:14,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:14,755 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:14,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-12-13 17:41:14,757 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 [2022-12-13 17:41:14,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:14,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:14,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:14,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:14,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:14,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:14,781 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 17:41:14,800 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-12-13 17:41:14,800 INFO L444 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-12-13 17:41:14,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:14,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:14,837 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:14,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-12-13 17:41:14,838 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 17:41:14,850 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 17:41:14,850 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 17:41:14,850 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~a~0#1.offset, ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1) = -1*ULTIMATE.start_main_~a~0#1.offset - 4*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~a~0#1.base)_1 Supporting invariants [] [2022-12-13 17:41:14,853 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-12-13 17:41:14,858 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-12-13 17:41:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:14,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 17:41:14,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:14,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 17:41:14,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:14,953 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-12-13 17:41:14,955 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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) [2022-12-13 17:41:14,999 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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 61 states and 85 transitions. Complement of second has 9 states. [2022-12-13 17:41:15,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-12-13 17:41:15,004 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) [2022-12-13 17:41:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 17:41:15,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 2 letters. [2022-12-13 17:41:15,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:15,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 5 letters. Loop has 2 letters. [2022-12-13 17:41:15,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:15,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 4 letters. [2022-12-13 17:41:15,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:15,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 85 transitions. [2022-12-13 17:41:15,010 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-12-13 17:41:15,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 27 states and 38 transitions. [2022-12-13 17:41:15,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-12-13 17:41:15,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-12-13 17:41:15,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2022-12-13 17:41:15,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:41:15,017 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 38 transitions. [2022-12-13 17:41:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2022-12-13 17:41:15,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-12-13 17:41:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) [2022-12-13 17:41:15,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2022-12-13 17:41:15,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 38 transitions. [2022-12-13 17:41:15,036 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2022-12-13 17:41:15,036 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 17:41:15,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 38 transitions. [2022-12-13 17:41:15,037 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-12-13 17:41:15,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:15,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:15,037 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-12-13 17:41:15,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 17:41:15,038 INFO L748 eck$LassoCheckResult]: Stem: 164#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 148#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; 150#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 140#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 158#$Ultimate##0 [2022-12-13 17:41:15,038 INFO L750 eck$LassoCheckResult]: Loop: 158#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 159#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); 141#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 158#$Ultimate##0 [2022-12-13 17:41:15,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:15,038 INFO L85 PathProgramCache]: Analyzing trace with hash 85954193, now seen corresponding path program 1 times [2022-12-13 17:41:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:15,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071509448] [2022-12-13 17:41:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:15,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:15,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:15,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071509448] [2022-12-13 17:41:15,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071509448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:15,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:15,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:41:15,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833083482] [2022-12-13 17:41:15,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:15,108 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:41:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 1 times [2022-12-13 17:41:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:15,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769941560] [2022-12-13 17:41:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:15,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:15,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:15,213 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-12-13 17:41:15,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:15,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:41:15,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:41:15,253 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. cyclomatic complexity: 15 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2022-12-13 17:41:15,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:15,266 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-12-13 17:41:15,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 36 transitions. [2022-12-13 17:41:15,267 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-12-13 17:41:15,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 36 transitions. [2022-12-13 17:41:15,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-12-13 17:41:15,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-12-13 17:41:15,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 36 transitions. [2022-12-13 17:41:15,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:41:15,268 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-12-13 17:41:15,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 36 transitions. [2022-12-13 17:41:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-12-13 17:41:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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) [2022-12-13 17:41:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-12-13 17:41:15,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-12-13 17:41:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:41:15,271 INFO L428 stractBuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-12-13 17:41:15,271 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 17:41:15,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2022-12-13 17:41:15,272 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-12-13 17:41:15,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:15,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:15,272 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:15,272 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 17:41:15,272 INFO L748 eck$LassoCheckResult]: Stem: 225#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 208#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 209#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; 211#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 212#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 213#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 201#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 219#$Ultimate##0 [2022-12-13 17:41:15,272 INFO L750 eck$LassoCheckResult]: Loop: 219#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 220#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); 202#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 219#$Ultimate##0 [2022-12-13 17:41:15,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:15,273 INFO L85 PathProgramCache]: Analyzing trace with hash 997650291, now seen corresponding path program 1 times [2022-12-13 17:41:15,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:15,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73898004] [2022-12-13 17:41:15,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:15,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:15,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:15,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:15,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 2 times [2022-12-13 17:41:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:15,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794386532] [2022-12-13 17:41:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:15,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:15,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:15,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:15,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash -173868929, now seen corresponding path program 1 times [2022-12-13 17:41:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:15,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732677915] [2022-12-13 17:41:15,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:15,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:15,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:15,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732677915] [2022-12-13 17:41:15,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732677915] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:41:15,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793955646] [2022-12-13 17:41:15,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:15,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:15,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:15,381 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:41:15,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 17:41:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:15,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 17:41:15,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:15,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:41:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:15,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793955646] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:41:15,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:41:15,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-12-13 17:41:15,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62101995] [2022-12-13 17:41:15,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:41:15,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:15,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:41:15,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:41:15,605 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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) [2022-12-13 17:41:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:15,658 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-12-13 17:41:15,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2022-12-13 17:41:15,660 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-12-13 17:41:15,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 32 states and 41 transitions. [2022-12-13 17:41:15,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-12-13 17:41:15,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-12-13 17:41:15,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 41 transitions. [2022-12-13 17:41:15,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:41:15,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-12-13 17:41:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 41 transitions. [2022-12-13 17:41:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-12-13 17:41:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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) [2022-12-13 17:41:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-12-13 17:41:15,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-12-13 17:41:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:41:15,667 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-12-13 17:41:15,668 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 17:41:15,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 37 transitions. [2022-12-13 17:41:15,668 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-12-13 17:41:15,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:15,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:15,669 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-12-13 17:41:15,669 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 17:41:15,669 INFO L748 eck$LassoCheckResult]: Stem: 361#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 343#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 344#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; 346#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 347#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 348#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 349#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 362#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 336#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 355#$Ultimate##0 [2022-12-13 17:41:15,669 INFO L750 eck$LassoCheckResult]: Loop: 355#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 356#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); 335#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 355#$Ultimate##0 [2022-12-13 17:41:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash 964272085, now seen corresponding path program 2 times [2022-12-13 17:41:15,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:15,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060794883] [2022-12-13 17:41:15,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:15,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:15,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:15,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:15,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:15,698 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 3 times [2022-12-13 17:41:15,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:15,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841262983] [2022-12-13 17:41:15,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:15,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:15,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:15,709 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:15,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:15,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1888408797, now seen corresponding path program 2 times [2022-12-13 17:41:15,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:15,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399533870] [2022-12-13 17:41:15,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:15,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:15,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:15,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:16,203 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 17:41:16,204 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 17:41:16,204 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 17:41:16,204 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 17:41:16,204 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 17:41:16,204 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,204 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 17:41:16,204 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 17:41:16,204 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration4_Lasso [2022-12-13 17:41:16,204 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 17:41:16,204 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 17:41:16,208 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,210 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,211 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,212 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,214 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,215 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,217 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,218 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,219 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,221 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,222 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,223 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,226 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,228 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,229 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,230 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,347 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,349 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,351 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,352 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,353 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,354 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,355 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,356 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,357 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,358 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,359 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,360 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,361 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,362 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,363 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,364 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,365 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,366 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,367 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,368 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,369 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,370 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,371 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,373 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,374 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,375 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,376 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,378 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,379 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,380 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,381 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,383 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,384 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:16,653 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 17:41:16,653 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 17:41:16,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,655 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-12-13 17:41:16,657 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 [2022-12-13 17:41:16,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:16,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:16,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:16,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-12-13 17:41:16,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,673 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-12-13 17:41:16,676 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 [2022-12-13 17:41:16,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:16,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:16,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:16,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-12-13 17:41:16,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,691 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-12-13 17:41:16,694 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 [2022-12-13 17:41:16,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:16,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:16,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:16,706 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-12-13 17:41:16,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,709 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-12-13 17:41:16,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 [2022-12-13 17:41:16,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:16,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:16,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:16,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-12-13 17:41:16,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,727 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-12-13 17:41:16,729 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 [2022-12-13 17:41:16,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:16,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:16,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:16,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-12-13 17:41:16,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,744 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-12-13 17:41:16,746 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 [2022-12-13 17:41:16,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:16,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:16,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:16,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-12-13 17:41:16,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,762 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-12-13 17:41:16,764 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 [2022-12-13 17:41:16,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:16,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:16,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:16,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:16,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,780 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-12-13 17:41:16,782 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 [2022-12-13 17:41:16,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:16,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:16,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:16,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:16,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,801 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-12-13 17:41:16,803 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 [2022-12-13 17:41:16,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:16,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:16,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:16,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-12-13 17:41:16,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,818 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-12-13 17:41:16,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:41:16,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:16,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:16,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:16,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-12-13 17:41:16,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,836 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-12-13 17:41:16,838 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 [2022-12-13 17:41:16,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:16,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:16,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:16,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-12-13 17:41:16,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,853 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-12-13 17:41:16,855 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 [2022-12-13 17:41:16,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:16,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:16,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-12-13 17:41:16,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,875 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-12-13 17:41:16,878 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 [2022-12-13 17:41:16,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:16,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:16,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-12-13 17:41:16,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,896 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-12-13 17:41:16,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:41:16,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:16,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:16,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:16,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-12-13 17:41:16,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,913 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-12-13 17:41:16,915 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 [2022-12-13 17:41:16,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:16,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:16,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:16,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,929 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-12-13 17:41:16,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,930 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-12-13 17:41:16,932 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 [2022-12-13 17:41:16,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,945 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:16,945 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:16,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:16,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:16,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,952 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-12-13 17:41:16,954 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 [2022-12-13 17:41:16,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:16,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:16,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:16,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:16,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:16,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:16,978 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 17:41:16,987 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-12-13 17:41:16,988 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-12-13 17:41:16,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:16,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:16,989 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:16,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-12-13 17:41:16,990 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 17:41:17,002 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 17:41:17,002 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 17:41:17,003 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n#1) = 1*merge_sort_#in~n#1 Supporting invariants [] [2022-12-13 17:41:17,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:17,010 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2022-12-13 17:41:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:17,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 17:41:17,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:17,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 17:41:17,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:17,066 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 [2022-12-13 17:41:17,066 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 12 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-12-13 17:41:17,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-12-13 17:41:17,101 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 37 transitions. cyclomatic complexity: 12. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 47 states and 59 transitions. Complement of second has 12 states. [2022-12-13 17:41:17,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-12-13 17:41:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-12-13 17:41:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-12-13 17:41:17,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2022-12-13 17:41:17,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:17,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 12 letters. Loop has 3 letters. [2022-12-13 17:41:17,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:17,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 6 letters. [2022-12-13 17:41:17,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:17,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. [2022-12-13 17:41:17,105 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-12-13 17:41:17,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 38 states and 50 transitions. [2022-12-13 17:41:17,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-12-13 17:41:17,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-12-13 17:41:17,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. [2022-12-13 17:41:17,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:41:17,106 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 50 transitions. [2022-12-13 17:41:17,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. [2022-12-13 17:41:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-12-13 17:41:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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) [2022-12-13 17:41:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2022-12-13 17:41:17,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-12-13 17:41:17,109 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2022-12-13 17:41:17,109 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 17:41:17,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 46 transitions. [2022-12-13 17:41:17,109 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-12-13 17:41:17,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:17,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:17,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:17,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:17,111 INFO L748 eck$LassoCheckResult]: Stem: 517#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 495#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 496#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; 498#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 499#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 500#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 501#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 518#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 488#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 510#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 511#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); 487#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 509#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 512#L24 assume ~n#1 < 2; 507#merge_sortFINAL assume true; 506#merge_sortEXIT >#87#return; 486#L27-1 [2022-12-13 17:41:17,111 INFO L750 eck$LassoCheckResult]: Loop: 486#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 508#$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); 489#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 508#$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; 497#merge_sortFINAL assume true; 519#merge_sortEXIT >#87#return; 486#L27-1 [2022-12-13 17:41:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash 825176348, now seen corresponding path program 1 times [2022-12-13 17:41:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:17,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731035471] [2022-12-13 17:41:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:17,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:17,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:17,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:17,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1429943866, now seen corresponding path program 1 times [2022-12-13 17:41:17,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:17,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843846435] [2022-12-13 17:41:17,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:17,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:17,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:17,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:17,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1545528235, now seen corresponding path program 1 times [2022-12-13 17:41:17,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:17,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634650513] [2022-12-13 17:41:17,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:17,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:17,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:41:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:17,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-12-13 17:41:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:41:17,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:17,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634650513] [2022-12-13 17:41:17,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634650513] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:41:17,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769084387] [2022-12-13 17:41:17,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:17,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:17,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:17,368 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:41:17,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 17:41:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:17,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 17:41:17,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:17,480 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:17,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:41:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:41:17,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769084387] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:41:17,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:41:17,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2022-12-13 17:41:17,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69582968] [2022-12-13 17:41:17,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:41:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:17,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 17:41:17,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-12-13 17:41:17,846 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. cyclomatic complexity: 15 Second operand has 15 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 12 states have internal predecessors, (24), 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) [2022-12-13 17:41:18,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:18,071 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-12-13 17:41:18,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 91 transitions. [2022-12-13 17:41:18,073 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 25 [2022-12-13 17:41:18,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 68 states and 86 transitions. [2022-12-13 17:41:18,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-12-13 17:41:18,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2022-12-13 17:41:18,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 86 transitions. [2022-12-13 17:41:18,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:41:18,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 86 transitions. [2022-12-13 17:41:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 86 transitions. [2022-12-13 17:41:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-12-13 17:41:18,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 54 states have internal predecessors, (66), 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) [2022-12-13 17:41:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2022-12-13 17:41:18,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 81 transitions. [2022-12-13 17:41:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 17:41:18,083 INFO L428 stractBuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2022-12-13 17:41:18,083 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 17:41:18,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 81 transitions. [2022-12-13 17:41:18,084 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 24 [2022-12-13 17:41:18,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:18,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:18,085 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:18,085 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:18,085 INFO L748 eck$LassoCheckResult]: Stem: 818#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 788#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 789#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; 791#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 792#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 793#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 794#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 839#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 830#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 829#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 781#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 822#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 808#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); 779#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 803#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 807#L24 assume ~n#1 < 2; 815#merge_sortFINAL assume true; 799#merge_sortEXIT >#87#return; 780#L27-1 [2022-12-13 17:41:18,085 INFO L750 eck$LassoCheckResult]: Loop: 780#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 802#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 840#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); 782#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 802#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 840#L24 assume ~n#1 < 2; 800#merge_sortFINAL assume true; 801#merge_sortEXIT >#87#return; 780#L27-1 [2022-12-13 17:41:18,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:18,086 INFO L85 PathProgramCache]: Analyzing trace with hash -682635526, now seen corresponding path program 2 times [2022-12-13 17:41:18,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:18,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702347901] [2022-12-13 17:41:18,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:18,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:18,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:18,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1429943866, now seen corresponding path program 2 times [2022-12-13 17:41:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:18,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825405050] [2022-12-13 17:41:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:18,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:18,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:18,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:18,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:18,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1251148749, now seen corresponding path program 2 times [2022-12-13 17:41:18,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:18,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449850626] [2022-12-13 17:41:18,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:18,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:18,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:18,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:19,132 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 17:41:19,132 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 17:41:19,132 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 17:41:19,132 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 17:41:19,132 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 17:41:19,132 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,132 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 17:41:19,132 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 17:41:19,132 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration6_Lasso [2022-12-13 17:41:19,132 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 17:41:19,132 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 17:41:19,134 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,136 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,137 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,139 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,140 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,141 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,143 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,144 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,146 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,147 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,148 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,150 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,151 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,152 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,153 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,155 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,156 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,157 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,159 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,160 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,161 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,163 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,164 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,165 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,167 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,168 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,169 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,171 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,172 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,173 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,175 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,176 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,177 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,179 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,180 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,346 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,347 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,348 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,349 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,351 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,352 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,353 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,354 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,355 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:19,655 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 17:41:19,655 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 17:41:19,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,656 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-12-13 17:41:19,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 [2022-12-13 17:41:19,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,672 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-12-13 17:41:19,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,677 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-12-13 17:41:19,679 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 [2022-12-13 17:41:19,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,689 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:19,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,694 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-12-13 17:41:19,696 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 [2022-12-13 17:41:19,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:19,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:19,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-12-13 17:41:19,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,714 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-12-13 17:41:19,716 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 [2022-12-13 17:41:19,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-12-13 17:41:19,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,731 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-12-13 17:41:19,733 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 [2022-12-13 17:41:19,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:19,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,748 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-12-13 17:41:19,750 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 [2022-12-13 17:41:19,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,760 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,761 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:19,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,766 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-12-13 17:41:19,768 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 [2022-12-13 17:41:19,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,782 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:19,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,783 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-12-13 17:41:19,785 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 [2022-12-13 17:41:19,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-12-13 17:41:19,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,801 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-12-13 17:41:19,803 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 [2022-12-13 17:41:19,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-12-13 17:41:19,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,818 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-12-13 17:41:19,821 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 [2022-12-13 17:41:19,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,834 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-12-13 17:41:19,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,835 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-12-13 17:41:19,837 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 [2022-12-13 17:41:19,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-12-13 17:41:19,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,852 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-12-13 17:41:19,854 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 [2022-12-13 17:41:19,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-12-13 17:41:19,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,868 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-12-13 17:41:19,870 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 [2022-12-13 17:41:19,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:19,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,885 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-12-13 17:41:19,887 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 [2022-12-13 17:41:19,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-12-13 17:41:19,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,902 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-12-13 17:41:19,904 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 [2022-12-13 17:41:19,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:19,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,919 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-12-13 17:41:19,921 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 [2022-12-13 17:41:19,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-12-13 17:41:19,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,935 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-12-13 17:41:19,937 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 [2022-12-13 17:41:19,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-12-13 17:41:19,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,952 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-12-13 17:41:19,954 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 [2022-12-13 17:41:19,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,965 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-12-13 17:41:19,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,969 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-12-13 17:41:19,971 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 [2022-12-13 17:41:19,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:19,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:19,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-12-13 17:41:19,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:19,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:19,986 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:19,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-12-13 17:41:19,989 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 [2022-12-13 17:41:19,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:19,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:19,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:19,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:19,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:19,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:19,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-12-13 17:41:20,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,003 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-12-13 17:41:20,005 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 [2022-12-13 17:41:20,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:20,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:20,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:20,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,019 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-12-13 17:41:20,021 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 [2022-12-13 17:41:20,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:20,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:20,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-12-13 17:41:20,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,036 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-12-13 17:41:20,038 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 [2022-12-13 17:41:20,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:20,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:20,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-12-13 17:41:20,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,053 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-12-13 17:41:20,055 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 [2022-12-13 17:41:20,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:20,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:20,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:20,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,069 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-12-13 17:41:20,072 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 [2022-12-13 17:41:20,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:20,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:20,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-12-13 17:41:20,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,090 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-12-13 17:41:20,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 [2022-12-13 17:41:20,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:20,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:20,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,105 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-12-13 17:41:20,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,106 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-12-13 17:41:20,109 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 [2022-12-13 17:41:20,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:20,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:20,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,123 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-12-13 17:41:20,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,124 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-12-13 17:41:20,126 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 [2022-12-13 17:41:20,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:20,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,136 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:20,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:20,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,140 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-12-13 17:41:20,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 [2022-12-13 17:41:20,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:20,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:20,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,154 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,156 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-12-13 17:41:20,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,157 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-12-13 17:41:20,159 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 [2022-12-13 17:41:20,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:20,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:20,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-12-13 17:41:20,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,175 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-12-13 17:41:20,177 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 [2022-12-13 17:41:20,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:20,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:20,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-12-13 17:41:20,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,192 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-12-13 17:41:20,194 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 [2022-12-13 17:41:20,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:20,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:20,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,208 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-12-13 17:41:20,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,209 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-12-13 17:41:20,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 [2022-12-13 17:41:20,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:20,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:20,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-12-13 17:41:20,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,226 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-12-13 17:41:20,229 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 [2022-12-13 17:41:20,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:20,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:20,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:20,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:20,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-12-13 17:41:20,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,244 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-12-13 17:41:20,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:41:20,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:20,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:20,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:20,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:20,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:20,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:20,277 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 17:41:20,298 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-12-13 17:41:20,298 INFO L444 ModelExtractionUtils]: 0 out of 25 variables were initially zero. Simplification set additionally 22 variables to zero. [2022-12-13 17:41:20,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:20,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:20,299 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:20,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-12-13 17:41:20,301 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 17:41:20,312 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 17:41:20,312 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 17:41:20,312 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_~m~0#1, merge_sort_~n#1) = -1*merge_sort_~m~0#1 + 1*merge_sort_~n#1 Supporting invariants [] [2022-12-13 17:41:20,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:20,317 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-12-13 17:41:20,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:20,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 17:41:20,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:20,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 17:41:20,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:20,426 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2022-12-13 17:41:20,426 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 23 Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 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) [2022-12-13 17:41:20,530 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 23. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 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 323 states and 438 transitions. Complement of second has 28 states. [2022-12-13 17:41:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-12-13 17:41:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 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) [2022-12-13 17:41:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2022-12-13 17:41:20,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 70 transitions. Stem has 18 letters. Loop has 8 letters. [2022-12-13 17:41:20,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:20,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 70 transitions. Stem has 26 letters. Loop has 8 letters. [2022-12-13 17:41:20,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:20,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 70 transitions. Stem has 18 letters. Loop has 16 letters. [2022-12-13 17:41:20,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:20,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 323 states and 438 transitions. [2022-12-13 17:41:20,540 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 88 [2022-12-13 17:41:20,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 323 states to 235 states and 325 transitions. [2022-12-13 17:41:20,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2022-12-13 17:41:20,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 172 [2022-12-13 17:41:20,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 325 transitions. [2022-12-13 17:41:20,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:41:20,545 INFO L218 hiAutomatonCegarLoop]: Abstraction has 235 states and 325 transitions. [2022-12-13 17:41:20,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states and 325 transitions. [2022-12-13 17:41:20,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:20,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 214. [2022-12-13 17:41:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 177 states have (on average 1.2937853107344632) internal successors, (229), 179 states have internal predecessors, (229), 23 states have call successors, (27), 14 states have call predecessors, (27), 14 states have return successors, (34), 20 states have call predecessors, (34), 21 states have call successors, (34) [2022-12-13 17:41:20,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 290 transitions. [2022-12-13 17:41:20,568 INFO L240 hiAutomatonCegarLoop]: Abstraction has 214 states and 290 transitions. [2022-12-13 17:41:20,568 INFO L428 stractBuchiCegarLoop]: Abstraction has 214 states and 290 transitions. [2022-12-13 17:41:20,568 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 17:41:20,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 290 transitions. [2022-12-13 17:41:20,570 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 78 [2022-12-13 17:41:20,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:20,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:20,571 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:20,571 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-12-13 17:41:20,571 INFO L748 eck$LassoCheckResult]: Stem: 1380#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1318#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1319#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; 1327#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1328#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1329#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1330#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1331#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1364#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1379#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1413#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); 1410#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 1411#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1417#L24 assume ~n#1 < 2; 1416#merge_sortFINAL assume true; 1414#merge_sortEXIT >#87#return; 1355#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 1354#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 1356#L24 assume ~n#1 < 2; 1465#merge_sortFINAL assume true; 1463#merge_sortEXIT >#89#return; 1459#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 1456#L11-3 [2022-12-13 17:41:20,571 INFO L750 eck$LassoCheckResult]: Loop: 1456#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 1457#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 1460#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 1458#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 1456#L11-3 [2022-12-13 17:41:20,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:20,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1029593046, now seen corresponding path program 1 times [2022-12-13 17:41:20,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:20,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55384301] [2022-12-13 17:41:20,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:20,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:20,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:20,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:20,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:20,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1388838, now seen corresponding path program 1 times [2022-12-13 17:41:20,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:20,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421373696] [2022-12-13 17:41:20,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:20,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:20,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:20,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:20,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:20,613 INFO L85 PathProgramCache]: Analyzing trace with hash -874210097, now seen corresponding path program 1 times [2022-12-13 17:41:20,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:20,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18431624] [2022-12-13 17:41:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:41:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:41:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 17:41:20,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:20,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18431624] [2022-12-13 17:41:20,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18431624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:20,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:20,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:41:20,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109762102] [2022-12-13 17:41:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:20,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:20,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:20,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:20,817 INFO L87 Difference]: Start difference. First operand 214 states and 290 transitions. cyclomatic complexity: 100 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 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) [2022-12-13 17:41:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:20,908 INFO L93 Difference]: Finished difference Result 350 states and 488 transitions. [2022-12-13 17:41:20,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 488 transitions. [2022-12-13 17:41:20,913 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 136 [2022-12-13 17:41:20,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 350 states and 488 transitions. [2022-12-13 17:41:20,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 257 [2022-12-13 17:41:20,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 257 [2022-12-13 17:41:20,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 350 states and 488 transitions. [2022-12-13 17:41:20,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:41:20,917 INFO L218 hiAutomatonCegarLoop]: Abstraction has 350 states and 488 transitions. [2022-12-13 17:41:20,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 488 transitions. [2022-12-13 17:41:20,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 268. [2022-12-13 17:41:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 231 states have (on average 1.2640692640692641) internal successors, (292), 233 states have internal predecessors, (292), 23 states have call successors, (27), 14 states have call predecessors, (27), 14 states have return successors, (34), 20 states have call predecessors, (34), 21 states have call successors, (34) [2022-12-13 17:41:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 353 transitions. [2022-12-13 17:41:20,929 INFO L240 hiAutomatonCegarLoop]: Abstraction has 268 states and 353 transitions. [2022-12-13 17:41:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:41:20,930 INFO L428 stractBuchiCegarLoop]: Abstraction has 268 states and 353 transitions. [2022-12-13 17:41:20,930 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 17:41:20,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 268 states and 353 transitions. [2022-12-13 17:41:20,931 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2022-12-13 17:41:20,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:20,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:20,932 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:20,932 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:20,932 INFO L748 eck$LassoCheckResult]: Stem: 1975#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1912#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1913#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; 1916#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1917#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1918#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 1919#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 1920#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 1890#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 1971#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2018#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); 2015#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2016#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2022#L24 assume ~n#1 < 2; 2021#merge_sortFINAL assume true; 2019#merge_sortEXIT >#87#return; 2013#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2012#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2014#L24 assume ~n#1 < 2; 2128#merge_sortFINAL assume true; 2127#merge_sortEXIT >#89#return; 2075#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 2118#L11-3 [2022-12-13 17:41:20,932 INFO L750 eck$LassoCheckResult]: Loop: 2118#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 2119#L12 assume !(merge_~j~0#1 == merge_~n#1); 1907#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 1908#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 2153#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 2152#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 2148#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 2149#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 2118#L11-3 [2022-12-13 17:41:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:20,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1029593046, now seen corresponding path program 2 times [2022-12-13 17:41:20,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:20,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224598524] [2022-12-13 17:41:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:20,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:20,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:20,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:20,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash -120477233, now seen corresponding path program 1 times [2022-12-13 17:41:20,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:20,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128997204] [2022-12-13 17:41:20,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:20,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:20,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:20,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash 843127032, now seen corresponding path program 1 times [2022-12-13 17:41:20,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:20,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734207406] [2022-12-13 17:41:20,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:20,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:20,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:22,176 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 17:41:22,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 17:41:22,177 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 17:41:22,177 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 17:41:22,177 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 17:41:22,177 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:22,177 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 17:41:22,177 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 17:41:22,177 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration8_Lasso [2022-12-13 17:41:22,177 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 17:41:22,177 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 17:41:22,179 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,180 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,181 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,182 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,183 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,184 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,185 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,186 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,187 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,188 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,189 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,190 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,191 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,193 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,194 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,195 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,196 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,197 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,199 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,200 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,201 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,202 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,769 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,771 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,772 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,773 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,775 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,776 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,777 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,778 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:22,780 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:23,743 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 17:41:23,743 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 17:41:23,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,744 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-12-13 17:41:23,746 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 [2022-12-13 17:41:23,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:23,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:23,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-12-13 17:41:23,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,762 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-12-13 17:41:23,764 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 [2022-12-13 17:41:23,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:23,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:23,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-12-13 17:41:23,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,779 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-12-13 17:41:23,782 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 [2022-12-13 17:41:23,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,792 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:23,792 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:23,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-12-13 17:41:23,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,797 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-12-13 17:41:23,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:41:23,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:23,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:23,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-12-13 17:41:23,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,814 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-12-13 17:41:23,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:41:23,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:23,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:23,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-12-13 17:41:23,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,830 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-12-13 17:41:23,832 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 [2022-12-13 17:41:23,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:23,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:23,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-12-13 17:41:23,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,847 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-12-13 17:41:23,850 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 [2022-12-13 17:41:23,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:23,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:23,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-12-13 17:41:23,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,864 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-12-13 17:41:23,866 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 [2022-12-13 17:41:23,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:23,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:23,878 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-12-13 17:41:23,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,881 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-12-13 17:41:23,883 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 [2022-12-13 17:41:23,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:23,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:23,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-12-13 17:41:23,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,898 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-12-13 17:41:23,901 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 [2022-12-13 17:41:23,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:23,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:23,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-12-13 17:41:23,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,916 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-12-13 17:41:23,918 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 [2022-12-13 17:41:23,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:23,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:23,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2022-12-13 17:41:23,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,933 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-12-13 17:41:23,935 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 [2022-12-13 17:41:23,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:23,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:23,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,950 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-12-13 17:41:23,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,951 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-12-13 17:41:23,953 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 [2022-12-13 17:41:23,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:23,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:23,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-12-13 17:41:23,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,970 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-12-13 17:41:23,972 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 [2022-12-13 17:41:23,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:23,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:23,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:23,984 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:23,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-12-13 17:41:23,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:23,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:23,987 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:23,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-12-13 17:41:23,989 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 [2022-12-13 17:41:23,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:23,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:23,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:23,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:23,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:24,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:24,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:24,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:24,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-12-13 17:41:24,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:24,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:24,004 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:24,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-12-13 17:41:24,007 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 [2022-12-13 17:41:24,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:24,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:24,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:24,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:24,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:24,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:24,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:24,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:24,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:24,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:24,024 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:24,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-12-13 17:41:24,026 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 [2022-12-13 17:41:24,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:24,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:24,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:24,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:24,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:24,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:24,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:24,038 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:24,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-12-13 17:41:24,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:24,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:24,041 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:24,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-12-13 17:41:24,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:41:24,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:24,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:24,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:24,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:24,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:24,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:24,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:24,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:24,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-12-13 17:41:24,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:24,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:24,058 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:24,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-12-13 17:41:24,060 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 [2022-12-13 17:41:24,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:24,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:24,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:24,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:24,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:24,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:24,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:24,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:24,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-12-13 17:41:24,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:24,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:24,074 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:24,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-12-13 17:41:24,077 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 [2022-12-13 17:41:24,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:24,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:24,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:24,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:24,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:24,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:24,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:24,088 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:24,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:24,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:24,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:24,091 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:24,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-12-13 17:41:24,094 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 [2022-12-13 17:41:24,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:24,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:24,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:24,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:24,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:24,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:24,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:24,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:24,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2022-12-13 17:41:24,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:24,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:24,109 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:24,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-12-13 17:41:24,111 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 [2022-12-13 17:41:24,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:24,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:24,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:24,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:24,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:24,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:24,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:24,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:24,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:24,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:24,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:24,126 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:24,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-12-13 17:41:24,129 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 [2022-12-13 17:41:24,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:24,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:24,139 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-12-13 17:41:24,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:24,203 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2022-12-13 17:41:24,203 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2022-12-13 17:41:24,986 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 17:41:27,531 INFO L443 ModelExtractionUtils]: Simplification made 68 calls to the SMT solver. [2022-12-13 17:41:27,531 INFO L444 ModelExtractionUtils]: 81 out of 190 variables were initially zero. Simplification set additionally 105 variables to zero. [2022-12-13 17:41:27,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:27,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:27,532 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:27,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-12-13 17:41:27,534 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 17:41:27,548 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2022-12-13 17:41:27,548 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 17:41:27,548 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~x~0#1.offset, v_rep(select #length merge_sort_#in~a#1.base)_3, merge_sort_merge_~k~0#1) = -1*merge_sort_merge_~x~0#1.offset + 1*v_rep(select #length merge_sort_#in~a#1.base)_3 - 4*merge_sort_merge_~k~0#1 Supporting invariants [] [2022-12-13 17:41:27,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:27,590 INFO L156 tatePredicateManager]: 8 out of 10 supporting invariants were superfluous and have been removed [2022-12-13 17:41:27,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:27,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-12-13 17:41:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:27,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 17:41:27,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:27,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 17:41:27,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:27,819 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2022-12-13 17:41:27,819 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 268 states and 353 transitions. cyclomatic complexity: 109 Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 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) [2022-12-13 17:41:27,969 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 268 states and 353 transitions. cyclomatic complexity: 109. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 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 393 states and 528 transitions. Complement of second has 26 states. [2022-12-13 17:41:27,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 5 stem states 3 non-accepting loop states 2 accepting loop states [2022-12-13 17:41:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 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) [2022-12-13 17:41:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-12-13 17:41:27,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 22 letters. Loop has 8 letters. [2022-12-13 17:41:27,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:27,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 30 letters. Loop has 8 letters. [2022-12-13 17:41:27,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:27,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 22 letters. Loop has 16 letters. [2022-12-13 17:41:27,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:27,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 393 states and 528 transitions. [2022-12-13 17:41:27,974 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 124 [2022-12-13 17:41:27,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 393 states to 367 states and 500 transitions. [2022-12-13 17:41:27,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2022-12-13 17:41:27,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 260 [2022-12-13 17:41:27,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 367 states and 500 transitions. [2022-12-13 17:41:27,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:41:27,979 INFO L218 hiAutomatonCegarLoop]: Abstraction has 367 states and 500 transitions. [2022-12-13 17:41:27,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states and 500 transitions. [2022-12-13 17:41:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 290. [2022-12-13 17:41:27,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 255 states have internal predecessors, (324), 23 states have call successors, (27), 14 states have call predecessors, (27), 14 states have return successors, (34), 20 states have call predecessors, (34), 21 states have call successors, (34) [2022-12-13 17:41:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 385 transitions. [2022-12-13 17:41:27,990 INFO L240 hiAutomatonCegarLoop]: Abstraction has 290 states and 385 transitions. [2022-12-13 17:41:27,990 INFO L428 stractBuchiCegarLoop]: Abstraction has 290 states and 385 transitions. [2022-12-13 17:41:27,990 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 17:41:27,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 385 transitions. [2022-12-13 17:41:27,991 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2022-12-13 17:41:27,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:27,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:27,991 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:27,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 17:41:27,992 INFO L748 eck$LassoCheckResult]: Stem: 2827#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2764#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2765#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; 2769#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2770#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2771#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 2772#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 2773#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 2762#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 2823#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2886#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); 2883#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 2884#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2887#L24 assume ~n#1 < 2; 2885#merge_sortFINAL assume true; 2882#merge_sortEXIT >#87#return; 2873#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 2874#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 2879#L24 assume ~n#1 < 2; 2875#merge_sortFINAL assume true; 2876#merge_sortEXIT >#89#return; 2869#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 2870#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 2818#L11-4 merge_~i~0#1 := 0; 2809#L17-3 [2022-12-13 17:41:27,992 INFO L750 eck$LassoCheckResult]: Loop: 2809#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 2808#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 2809#L17-3 [2022-12-13 17:41:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1596438681, now seen corresponding path program 1 times [2022-12-13 17:41:27,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:27,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733730187] [2022-12-13 17:41:27,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:27,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:28,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:41:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:28,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:41:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 17:41:28,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:28,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733730187] [2022-12-13 17:41:28,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733730187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:28,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:28,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:41:28,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316547426] [2022-12-13 17:41:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:28,041 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:41:28,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2022-12-13 17:41:28,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:28,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248786490] [2022-12-13 17:41:28,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:28,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:28,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:28,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:28,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:28,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:28,093 INFO L87 Difference]: Start difference. First operand 290 states and 385 transitions. cyclomatic complexity: 121 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 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) [2022-12-13 17:41:28,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:28,161 INFO L93 Difference]: Finished difference Result 423 states and 554 transitions. [2022-12-13 17:41:28,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 554 transitions. [2022-12-13 17:41:28,165 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 122 [2022-12-13 17:41:28,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 423 states and 554 transitions. [2022-12-13 17:41:28,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2022-12-13 17:41:28,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2022-12-13 17:41:28,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 423 states and 554 transitions. [2022-12-13 17:41:28,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:41:28,168 INFO L218 hiAutomatonCegarLoop]: Abstraction has 423 states and 554 transitions. [2022-12-13 17:41:28,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states and 554 transitions. [2022-12-13 17:41:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 297. [2022-12-13 17:41:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 260 states have (on average 1.2653846153846153) internal successors, (329), 262 states have internal predecessors, (329), 23 states have call successors, (27), 14 states have call predecessors, (27), 14 states have return successors, (34), 20 states have call predecessors, (34), 21 states have call successors, (34) [2022-12-13 17:41:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 390 transitions. [2022-12-13 17:41:28,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 297 states and 390 transitions. [2022-12-13 17:41:28,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:41:28,178 INFO L428 stractBuchiCegarLoop]: Abstraction has 297 states and 390 transitions. [2022-12-13 17:41:28,178 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-12-13 17:41:28,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 297 states and 390 transitions. [2022-12-13 17:41:28,179 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 120 [2022-12-13 17:41:28,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:28,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:28,179 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:28,179 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-12-13 17:41:28,180 INFO L748 eck$LassoCheckResult]: Stem: 3563#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3496#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 3497#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; 3506#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 3507#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 3508#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 3509#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 3510#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 3526#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 3560#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3601#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); 3525#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 3527#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3625#L24 assume ~n#1 < 2; 3624#merge_sortFINAL assume true; 3622#merge_sortEXIT >#87#return; 3535#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 3534#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 3536#L24 assume ~n#1 < 2; 3651#merge_sortFINAL assume true; 3649#merge_sortEXIT >#89#return; 3640#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 3641#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 3542#L12 assume !(merge_~j~0#1 == merge_~n#1); 3734#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 3727#L13-2 [2022-12-13 17:41:28,180 INFO L750 eck$LassoCheckResult]: Loop: 3727#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 3716#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 3713#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 3714#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 3725#L12 assume !(merge_~j~0#1 == merge_~n#1); 3726#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 3727#L13-2 [2022-12-13 17:41:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2050009704, now seen corresponding path program 1 times [2022-12-13 17:41:28,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:28,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50193098] [2022-12-13 17:41:28,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:28,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:28,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:41:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:28,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:41:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:28,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 17:41:28,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:28,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50193098] [2022-12-13 17:41:28,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50193098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:41:28,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:41:28,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:41:28,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976150446] [2022-12-13 17:41:28,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:41:28,324 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:41:28,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:28,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1895288687, now seen corresponding path program 1 times [2022-12-13 17:41:28,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:28,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750395305] [2022-12-13 17:41:28,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:28,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:28,329 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:28,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:28,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:28,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:41:28,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:41:28,435 INFO L87 Difference]: Start difference. First operand 297 states and 390 transitions. cyclomatic complexity: 119 Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 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) [2022-12-13 17:41:28,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:28,541 INFO L93 Difference]: Finished difference Result 398 states and 529 transitions. [2022-12-13 17:41:28,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 398 states and 529 transitions. [2022-12-13 17:41:28,544 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 164 [2022-12-13 17:41:28,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 398 states to 394 states and 525 transitions. [2022-12-13 17:41:28,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 277 [2022-12-13 17:41:28,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 277 [2022-12-13 17:41:28,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 394 states and 525 transitions. [2022-12-13 17:41:28,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:41:28,549 INFO L218 hiAutomatonCegarLoop]: Abstraction has 394 states and 525 transitions. [2022-12-13 17:41:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states and 525 transitions. [2022-12-13 17:41:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 358. [2022-12-13 17:41:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 321 states have (on average 1.264797507788162) internal successors, (406), 323 states have internal predecessors, (406), 23 states have call successors, (27), 14 states have call predecessors, (27), 14 states have return successors, (34), 20 states have call predecessors, (34), 21 states have call successors, (34) [2022-12-13 17:41:28,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 467 transitions. [2022-12-13 17:41:28,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 358 states and 467 transitions. [2022-12-13 17:41:28,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:41:28,562 INFO L428 stractBuchiCegarLoop]: Abstraction has 358 states and 467 transitions. [2022-12-13 17:41:28,562 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-12-13 17:41:28,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 358 states and 467 transitions. [2022-12-13 17:41:28,565 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 162 [2022-12-13 17:41:28,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:28,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:28,565 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:28,566 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 17:41:28,566 INFO L748 eck$LassoCheckResult]: Stem: 4281#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4216#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4217#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; 4224#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 4225#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4226#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 4227#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4228#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 4286#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 4285#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 4258#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 4299#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4272#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); 4211#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4246#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4253#L24 assume ~n#1 < 2; 4303#merge_sortFINAL assume true; 4302#merge_sortEXIT >#87#return; 4219#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 4297#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4295#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); 4207#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4294#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4368#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); 4204#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4399#$Ultimate##0 [2022-12-13 17:41:28,566 INFO L750 eck$LassoCheckResult]: Loop: 4399#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 4316#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); 4202#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 4399#$Ultimate##0 [2022-12-13 17:41:28,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash -178906914, now seen corresponding path program 3 times [2022-12-13 17:41:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:28,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688194] [2022-12-13 17:41:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:28,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:28,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 17:41:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:28,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:28,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688194] [2022-12-13 17:41:28,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688194] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:41:28,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673504309] [2022-12-13 17:41:28,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:41:28,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:28,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:28,867 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:41:28,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-12-13 17:41:28,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 17:41:28,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:41:28,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 17:41:28,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:29,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:29,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:41:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:29,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673504309] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:41:29,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:41:29,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 25 [2022-12-13 17:41:29,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183250179] [2022-12-13 17:41:29,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:41:29,158 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:41:29,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:29,158 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 4 times [2022-12-13 17:41:29,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:29,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695789879] [2022-12-13 17:41:29,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:29,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:29,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:29,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:29,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:29,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-13 17:41:29,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-12-13 17:41:29,262 INFO L87 Difference]: Start difference. First operand 358 states and 467 transitions. cyclomatic complexity: 135 Second operand has 25 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 20 states have internal predecessors, (35), 7 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:41:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:29,858 INFO L93 Difference]: Finished difference Result 715 states and 934 transitions. [2022-12-13 17:41:29,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 715 states and 934 transitions. [2022-12-13 17:41:29,867 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 340 [2022-12-13 17:41:29,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 715 states to 707 states and 923 transitions. [2022-12-13 17:41:29,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 552 [2022-12-13 17:41:29,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 569 [2022-12-13 17:41:29,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 707 states and 923 transitions. [2022-12-13 17:41:29,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:41:29,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 707 states and 923 transitions. [2022-12-13 17:41:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states and 923 transitions. [2022-12-13 17:41:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 585. [2022-12-13 17:41:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 516 states have (on average 1.253875968992248) internal successors, (647), 520 states have internal predecessors, (647), 41 states have call successors, (48), 29 states have call predecessors, (48), 28 states have return successors, (57), 35 states have call predecessors, (57), 37 states have call successors, (57) [2022-12-13 17:41:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 752 transitions. [2022-12-13 17:41:29,890 INFO L240 hiAutomatonCegarLoop]: Abstraction has 585 states and 752 transitions. [2022-12-13 17:41:29,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 17:41:29,890 INFO L428 stractBuchiCegarLoop]: Abstraction has 585 states and 752 transitions. [2022-12-13 17:41:29,891 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-12-13 17:41:29,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 585 states and 752 transitions. [2022-12-13 17:41:29,895 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 272 [2022-12-13 17:41:29,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:29,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:29,895 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:29,895 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:29,896 INFO L748 eck$LassoCheckResult]: Stem: 5576#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 5509#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 5510#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; 5516#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 5517#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 5518#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 5519#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 5610#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 5502#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 5573#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5665#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); 5663#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 5668#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5669#L24 assume ~n#1 < 2; 5662#merge_sortFINAL assume true; 5664#merge_sortEXIT >#87#return; 5653#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 5654#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 5692#L24 assume ~n#1 < 2; 5691#merge_sortFINAL assume true; 5690#merge_sortEXIT >#89#return; 5649#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 5648#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 5522#L12 assume !(merge_~j~0#1 == merge_~n#1); 5507#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 5508#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 5544#L14-2 [2022-12-13 17:41:29,896 INFO L750 eck$LassoCheckResult]: Loop: 5544#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 6069#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 6068#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 6067#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 6065#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 6066#L12 assume !(merge_~j~0#1 == merge_~n#1); 6064#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 5543#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 5544#L14-2 [2022-12-13 17:41:29,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:29,896 INFO L85 PathProgramCache]: Analyzing trace with hash -874208526, now seen corresponding path program 1 times [2022-12-13 17:41:29,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:29,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282428038] [2022-12-13 17:41:29,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:29,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:29,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:29,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:29,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:29,916 INFO L85 PathProgramCache]: Analyzing trace with hash -695534387, now seen corresponding path program 1 times [2022-12-13 17:41:29,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:29,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404391014] [2022-12-13 17:41:29,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:29,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:29,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:29,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1629101758, now seen corresponding path program 1 times [2022-12-13 17:41:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:29,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994868510] [2022-12-13 17:41:29,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:29,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:30,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:41:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:30,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:41:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 17:41:30,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:30,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994868510] [2022-12-13 17:41:30,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994868510] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:41:30,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516127235] [2022-12-13 17:41:30,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:30,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:30,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:30,102 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:41:30,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-12-13 17:41:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:30,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 17:41:30,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 17:41:30,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:41:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 17:41:30,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516127235] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:41:30,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:41:30,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-13 17:41:30,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851909380] [2022-12-13 17:41:30,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:41:30,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:30,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 17:41:30,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2022-12-13 17:41:30,594 INFO L87 Difference]: Start difference. First operand 585 states and 752 transitions. cyclomatic complexity: 203 Second operand has 18 states, 14 states have (on average 3.142857142857143) internal successors, (44), 12 states have internal predecessors, (44), 5 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 17:41:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:30,967 INFO L93 Difference]: Finished difference Result 1212 states and 1611 transitions. [2022-12-13 17:41:30,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1212 states and 1611 transitions. [2022-12-13 17:41:30,974 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 446 [2022-12-13 17:41:30,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1212 states to 1212 states and 1611 transitions. [2022-12-13 17:41:30,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 913 [2022-12-13 17:41:30,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 913 [2022-12-13 17:41:30,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1212 states and 1611 transitions. [2022-12-13 17:41:30,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:41:30,980 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1212 states and 1611 transitions. [2022-12-13 17:41:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states and 1611 transitions. [2022-12-13 17:41:30,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 695. [2022-12-13 17:41:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 621 states have (on average 1.2238325281803544) internal successors, (760), 623 states have internal predecessors, (760), 41 states have call successors, (48), 29 states have call predecessors, (48), 33 states have return successors, (72), 42 states have call predecessors, (72), 37 states have call successors, (72) [2022-12-13 17:41:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 880 transitions. [2022-12-13 17:41:30,997 INFO L240 hiAutomatonCegarLoop]: Abstraction has 695 states and 880 transitions. [2022-12-13 17:41:30,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 17:41:30,998 INFO L428 stractBuchiCegarLoop]: Abstraction has 695 states and 880 transitions. [2022-12-13 17:41:30,998 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-12-13 17:41:30,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 695 states and 880 transitions. [2022-12-13 17:41:31,002 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 280 [2022-12-13 17:41:31,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:31,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:31,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:31,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-12-13 17:41:31,003 INFO L748 eck$LassoCheckResult]: Stem: 7631#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7567#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 7568#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; 7573#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 7574#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 7575#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 7576#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 7636#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 7559#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 7630#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7705#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); 7703#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 7709#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7706#L24 assume ~n#1 < 2; 7702#merge_sortFINAL assume true; 7704#merge_sortEXIT >#87#return; 7693#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 7694#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 7724#L24 assume ~n#1 < 2; 7723#merge_sortFINAL assume true; 7692#merge_sortEXIT >#89#return; 7691#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 7779#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 7687#L12 assume !(merge_~j~0#1 == merge_~n#1); 7778#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 7776#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 7777#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 7560#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 7580#L12-2 [2022-12-13 17:41:31,003 INFO L750 eck$LassoCheckResult]: Loop: 7580#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 8154#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 8153#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 7579#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 7580#L12-2 [2022-12-13 17:41:31,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:31,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1699197556, now seen corresponding path program 1 times [2022-12-13 17:41:31,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:31,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612423865] [2022-12-13 17:41:31,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:31,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:31,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:31,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:31,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 2 times [2022-12-13 17:41:31,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:31,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890146882] [2022-12-13 17:41:31,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:31,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:31,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:31,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:31,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:31,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1016219225, now seen corresponding path program 1 times [2022-12-13 17:41:31,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:31,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894485886] [2022-12-13 17:41:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:31,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:31,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:31,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:33,462 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 17:41:33,462 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 17:41:33,462 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 17:41:33,462 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 17:41:33,462 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 17:41:33,462 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:33,462 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 17:41:33,462 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 17:41:33,462 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration13_Lasso [2022-12-13 17:41:33,462 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 17:41:33,462 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 17:41:33,465 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,466 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,468 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,469 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,470 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,472 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,473 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,475 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,476 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,477 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,478 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,480 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,481 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,482 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,484 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,485 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:33,487 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:34,581 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:34,582 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:34,583 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:34,584 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:35,361 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 17:41:35,361 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 17:41:35,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,362 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-12-13 17:41:35,364 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 [2022-12-13 17:41:35,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,374 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-12-13 17:41:35,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,378 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-12-13 17:41:35,381 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 [2022-12-13 17:41:35,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-12-13 17:41:35,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,395 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-12-13 17:41:35,397 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 [2022-12-13 17:41:35,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2022-12-13 17:41:35,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,412 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-12-13 17:41:35,414 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 [2022-12-13 17:41:35,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,428 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2022-12-13 17:41:35,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,429 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-12-13 17:41:35,431 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 [2022-12-13 17:41:35,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-12-13 17:41:35,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,446 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-12-13 17:41:35,449 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 [2022-12-13 17:41:35,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,459 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-12-13 17:41:35,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,463 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-12-13 17:41:35,466 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 [2022-12-13 17:41:35,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-12-13 17:41:35,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,480 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-12-13 17:41:35,482 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 [2022-12-13 17:41:35,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-12-13 17:41:35,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,498 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-12-13 17:41:35,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 [2022-12-13 17:41:35,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2022-12-13 17:41:35,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,514 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-12-13 17:41:35,516 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 [2022-12-13 17:41:35,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,526 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:35,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,530 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-12-13 17:41:35,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:41:35,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,544 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,546 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2022-12-13 17:41:35,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,547 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-12-13 17:41:35,549 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 [2022-12-13 17:41:35,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:35,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:35,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2022-12-13 17:41:35,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,567 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-12-13 17:41:35,570 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 [2022-12-13 17:41:35,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2022-12-13 17:41:35,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,585 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-12-13 17:41:35,588 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 [2022-12-13 17:41:35,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,599 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-12-13 17:41:35,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,603 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-12-13 17:41:35,605 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 [2022-12-13 17:41:35,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:35,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:35,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:35,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,621 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-12-13 17:41:35,623 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 [2022-12-13 17:41:35,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-12-13 17:41:35,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,638 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-12-13 17:41:35,640 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 [2022-12-13 17:41:35,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:35,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,655 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-12-13 17:41:35,657 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 [2022-12-13 17:41:35,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:35,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:35,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:35,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:35,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-12-13 17:41:35,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:35,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:35,672 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:35,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-12-13 17:41:35,674 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 [2022-12-13 17:41:35,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:35,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:35,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:35,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:35,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:35,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:35,734 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 17:41:36,033 INFO L443 ModelExtractionUtils]: Simplification made 53 calls to the SMT solver. [2022-12-13 17:41:36,034 INFO L444 ModelExtractionUtils]: 16 out of 70 variables were initially zero. Simplification set additionally 48 variables to zero. [2022-12-13 17:41:36,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:36,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:36,035 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:36,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-12-13 17:41:36,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 17:41:36,048 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-12-13 17:41:36,048 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 17:41:36,048 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1, merge_sort_~n#1, merge_sort_merge_~a#1.offset) = -4*merge_sort_merge_~i~0#1 + 36893488147419103224*merge_sort_~n#1 - 1*merge_sort_merge_~a#1.offset Supporting invariants [-1*v_rep(select #length merge_sort_#in~a#1.base)_4 + 18446744073709551612*merge_sort_~n#1 >= 0] [2022-12-13 17:41:36,052 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:36,093 INFO L156 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2022-12-13 17:41:36,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:36,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 17:41:36,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:36,169 INFO L350 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 [2022-12-13 17:41:36,173 INFO L350 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 [2022-12-13 17:41:36,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:41:36,350 INFO L350 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 12 treesize of output 14 [2022-12-13 17:41:36,357 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 17:41:36,357 INFO L350 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 [2022-12-13 17:41:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:36,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 17:41:36,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:36,443 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 [2022-12-13 17:41:36,443 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 695 states and 880 transitions. cyclomatic complexity: 245 Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 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) [2022-12-13 17:41:36,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-12-13 17:41:36,666 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 695 states and 880 transitions. cyclomatic complexity: 245. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 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 1116 states and 1414 transitions. Complement of second has 17 states. [2022-12-13 17:41:36,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 6 stem states 1 non-accepting loop states 1 accepting loop states [2022-12-13 17:41:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 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) [2022-12-13 17:41:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-12-13 17:41:36,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 28 letters. Loop has 4 letters. [2022-12-13 17:41:36,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:36,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 32 letters. Loop has 4 letters. [2022-12-13 17:41:36,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:36,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 37 transitions. Stem has 28 letters. Loop has 8 letters. [2022-12-13 17:41:36,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:36,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1116 states and 1414 transitions. [2022-12-13 17:41:36,673 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 244 [2022-12-13 17:41:36,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1116 states to 1092 states and 1381 transitions. [2022-12-13 17:41:36,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 682 [2022-12-13 17:41:36,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 719 [2022-12-13 17:41:36,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1092 states and 1381 transitions. [2022-12-13 17:41:36,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:41:36,679 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1092 states and 1381 transitions. [2022-12-13 17:41:36,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states and 1381 transitions. [2022-12-13 17:41:36,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1069. [2022-12-13 17:41:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 978 states have (on average 1.2259713701431494) internal successors, (1199), 978 states have internal predecessors, (1199), 53 states have call successors, (61), 35 states have call predecessors, (61), 38 states have return successors, (98), 55 states have call predecessors, (98), 49 states have call successors, (98) [2022-12-13 17:41:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1358 transitions. [2022-12-13 17:41:36,695 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1069 states and 1358 transitions. [2022-12-13 17:41:36,695 INFO L428 stractBuchiCegarLoop]: Abstraction has 1069 states and 1358 transitions. [2022-12-13 17:41:36,696 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-12-13 17:41:36,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1069 states and 1358 transitions. [2022-12-13 17:41:36,699 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 244 [2022-12-13 17:41:36,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:36,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:36,699 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:36,699 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 17:41:36,699 INFO L748 eck$LassoCheckResult]: Stem: 9643#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9574#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 9575#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; 9587#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 9588#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 9589#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 9590#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 9676#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 9570#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 9642#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9883#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); 9878#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 9942#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9947#L24 assume ~n#1 < 2; 9877#merge_sortFINAL assume true; 9879#merge_sortEXIT >#87#return; 9870#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 9871#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 9954#L24 assume ~n#1 < 2; 9952#merge_sortFINAL assume true; 9950#merge_sortEXIT >#89#return; 9867#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 9863#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 9861#L12 assume !(merge_~j~0#1 == merge_~n#1); 9862#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 9856#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 9857#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 10262#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 10260#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 10257#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 10170#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 10143#L11-4 merge_~i~0#1 := 0; 9627#L17-3 [2022-12-13 17:41:36,700 INFO L750 eck$LassoCheckResult]: Loop: 9627#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 9628#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 9627#L17-3 [2022-12-13 17:41:36,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:36,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1016219187, now seen corresponding path program 1 times [2022-12-13 17:41:36,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:36,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353251130] [2022-12-13 17:41:36,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:36,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:36,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:41:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:36,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 17:41:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 17:41:36,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:36,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353251130] [2022-12-13 17:41:36,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353251130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:41:36,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023946917] [2022-12-13 17:41:36,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:36,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:36,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:36,761 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:41:36,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2022-12-13 17:41:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:36,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 17:41:36,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:41:36,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:41:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:41:36,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023946917] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:41:36,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:41:36,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-12-13 17:41:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252513798] [2022-12-13 17:41:36,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:41:36,900 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:41:36,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:36,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2022-12-13 17:41:36,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:36,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881727720] [2022-12-13 17:41:36,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:36,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:36,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:36,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:36,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:36,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:41:36,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:41:36,959 INFO L87 Difference]: Start difference. First operand 1069 states and 1358 transitions. cyclomatic complexity: 365 Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 17:41:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:37,050 INFO L93 Difference]: Finished difference Result 1867 states and 2274 transitions. [2022-12-13 17:41:37,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1867 states and 2274 transitions. [2022-12-13 17:41:37,058 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 246 [2022-12-13 17:41:37,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1867 states to 1845 states and 2252 transitions. [2022-12-13 17:41:37,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1152 [2022-12-13 17:41:37,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1152 [2022-12-13 17:41:37,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1845 states and 2252 transitions. [2022-12-13 17:41:37,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:41:37,066 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1845 states and 2252 transitions. [2022-12-13 17:41:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states and 2252 transitions. [2022-12-13 17:41:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1285. [2022-12-13 17:41:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1192 states have (on average 1.1937919463087248) internal successors, (1423), 1194 states have internal predecessors, (1423), 53 states have call successors, (61), 35 states have call predecessors, (61), 40 states have return successors, (100), 55 states have call predecessors, (100), 49 states have call successors, (100) [2022-12-13 17:41:37,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1584 transitions. [2022-12-13 17:41:37,099 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1285 states and 1584 transitions. [2022-12-13 17:41:37,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:41:37,100 INFO L428 stractBuchiCegarLoop]: Abstraction has 1285 states and 1584 transitions. [2022-12-13 17:41:37,100 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-12-13 17:41:37,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1285 states and 1584 transitions. [2022-12-13 17:41:37,103 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 244 [2022-12-13 17:41:37,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:37,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:37,104 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] [2022-12-13 17:41:37,104 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 17:41:37,104 INFO L748 eck$LassoCheckResult]: Stem: 12805#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 12728#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 12729#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; 12733#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 12734#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 12735#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 12736#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 12823#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 12759#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 12800#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12991#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); 12758#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 12760#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 12993#L24 assume ~n#1 < 2; 12990#merge_sortFINAL assume true; 12983#merge_sortEXIT >#87#return; 12984#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 13272#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 13278#L24 assume ~n#1 < 2; 13277#merge_sortFINAL assume true; 13271#merge_sortEXIT >#89#return; 12921#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 13268#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13267#L12 assume !(merge_~j~0#1 == merge_~n#1); 13266#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 13264#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 13263#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 13262#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 13260#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 13257#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 13259#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 13258#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 13255#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 13256#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 13008#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 12798#L11-4 merge_~i~0#1 := 0; 12779#L17-3 [2022-12-13 17:41:37,104 INFO L750 eck$LassoCheckResult]: Loop: 12779#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 12776#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 12779#L17-3 [2022-12-13 17:41:37,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2097782888, now seen corresponding path program 1 times [2022-12-13 17:41:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:37,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376465177] [2022-12-13 17:41:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:37,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:37,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:37,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:37,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 3 times [2022-12-13 17:41:37,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:37,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643909078] [2022-12-13 17:41:37,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:37,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:37,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:37,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:37,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1629691942, now seen corresponding path program 1 times [2022-12-13 17:41:37,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:37,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076072544] [2022-12-13 17:41:37,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:37,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:37,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:37,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:39,902 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 17:41:39,902 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 17:41:39,902 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 17:41:39,902 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 17:41:39,902 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 17:41:39,902 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:39,902 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 17:41:39,902 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 17:41:39,902 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration15_Lasso [2022-12-13 17:41:39,902 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 17:41:39,902 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 17:41:39,906 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,907 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,908 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,910 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,911 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,912 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,913 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,914 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,916 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,917 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,918 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,919 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,920 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,921 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:39,923 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,750 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,751 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,752 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,753 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,754 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,755 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,756 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,757 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,758 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,759 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,760 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,761 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,762 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,763 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,763 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:40,765 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:41,374 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 17:41:41,374 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 17:41:41,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,375 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-12-13 17:41:41,377 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 [2022-12-13 17:41:41,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2022-12-13 17:41:41,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,391 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-12-13 17:41:41,393 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 [2022-12-13 17:41:41,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:41,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,408 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-12-13 17:41:41,410 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 [2022-12-13 17:41:41,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,420 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,422 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-12-13 17:41:41,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,425 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-12-13 17:41:41,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:41:41,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-12-13 17:41:41,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,442 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-12-13 17:41:41,443 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 [2022-12-13 17:41:41,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2022-12-13 17:41:41,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,458 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-12-13 17:41:41,461 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 [2022-12-13 17:41:41,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-12-13 17:41:41,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,475 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-12-13 17:41:41,477 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 [2022-12-13 17:41:41,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,489 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2022-12-13 17:41:41,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,492 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-12-13 17:41:41,494 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 [2022-12-13 17:41:41,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:41,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:41,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:41,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,513 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-12-13 17:41:41,515 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 [2022-12-13 17:41:41,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2022-12-13 17:41:41,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,529 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-12-13 17:41:41,531 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 [2022-12-13 17:41:41,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:41,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:41,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2022-12-13 17:41:41,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,548 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-12-13 17:41:41,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:41:41,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:41,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,566 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2022-12-13 17:41:41,569 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 [2022-12-13 17:41:41,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,579 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2022-12-13 17:41:41,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,584 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2022-12-13 17:41:41,586 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 [2022-12-13 17:41:41,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,597 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,598 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:41,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,601 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-12-13 17:41:41,603 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 [2022-12-13 17:41:41,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:41,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,618 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-12-13 17:41:41,620 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 [2022-12-13 17:41:41,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:41,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:41,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2022-12-13 17:41:41,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,638 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-12-13 17:41:41,641 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 [2022-12-13 17:41:41,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:41,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:41,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:41,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,662 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-12-13 17:41:41,664 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 [2022-12-13 17:41:41,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:41,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:41,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2022-12-13 17:41:41,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,699 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-12-13 17:41:41,701 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 [2022-12-13 17:41:41,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,711 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,714 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2022-12-13 17:41:41,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,715 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-12-13 17:41:41,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 [2022-12-13 17:41:41,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:41,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:41,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2022-12-13 17:41:41,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,735 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-12-13 17:41:41,737 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 [2022-12-13 17:41:41,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:41:41,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:41:41,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:41:41,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2022-12-13 17:41:41,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,753 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-12-13 17:41:41,754 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 [2022-12-13 17:41:41,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,765 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-12-13 17:41:41,765 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,765 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,768 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-12-13 17:41:41,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:41,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2022-12-13 17:41:41,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,785 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-12-13 17:41:41,787 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 [2022-12-13 17:41:41,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:41,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:41,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2022-12-13 17:41:41,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,805 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-12-13 17:41:41,807 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 [2022-12-13 17:41:41,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,819 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:41,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:41,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:41:41,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2022-12-13 17:41:41,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,824 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,825 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-12-13 17:41:41,827 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 [2022-12-13 17:41:41,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:41:41,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:41:41,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:41:41,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:41:41,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:41:41,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:41:41,887 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 17:41:41,927 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-12-13 17:41:41,927 INFO L444 ModelExtractionUtils]: 49 out of 64 variables were initially zero. Simplification set additionally 12 variables to zero. [2022-12-13 17:41:41,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:41,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:41,928 INFO L229 MonitoredProcess]: Starting monitored process 138 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:41:41,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-12-13 17:41:41,930 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 17:41:41,941 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 17:41:41,941 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 17:41:41,941 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~n#1, merge_sort_merge_~i~0#1) = 1*merge_sort_merge_~n#1 - 1*merge_sort_merge_~i~0#1 Supporting invariants [] [2022-12-13 17:41:41,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2022-12-13 17:41:42,011 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-12-13 17:41:42,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:42,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 17:41:42,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:42,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 17:41:42,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:41:42,130 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 [2022-12-13 17:41:42,130 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1285 states and 1584 transitions. cyclomatic complexity: 375 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2022-12-13 17:41:42,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1285 states and 1584 transitions. cyclomatic complexity: 375. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 1390 states and 1729 transitions. Complement of second has 12 states. [2022-12-13 17:41:42,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-12-13 17:41:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2022-12-13 17:41:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-13 17:41:42,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 36 letters. Loop has 2 letters. [2022-12-13 17:41:42,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:42,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 38 letters. Loop has 2 letters. [2022-12-13 17:41:42,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:42,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 36 letters. Loop has 4 letters. [2022-12-13 17:41:42,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:41:42,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1390 states and 1729 transitions. [2022-12-13 17:41:42,170 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 236 [2022-12-13 17:41:42,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1390 states to 1270 states and 1578 transitions. [2022-12-13 17:41:42,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 834 [2022-12-13 17:41:42,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 842 [2022-12-13 17:41:42,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1270 states and 1578 transitions. [2022-12-13 17:41:42,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:41:42,177 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1270 states and 1578 transitions. [2022-12-13 17:41:42,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states and 1578 transitions. [2022-12-13 17:41:42,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1213. [2022-12-13 17:41:42,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1126 states have (on average 1.199822380106572) internal successors, (1351), 1133 states have internal predecessors, (1351), 47 states have call successors, (52), 29 states have call predecessors, (52), 40 states have return successors, (105), 50 states have call predecessors, (105), 44 states have call successors, (105) [2022-12-13 17:41:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1508 transitions. [2022-12-13 17:41:42,195 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1213 states and 1508 transitions. [2022-12-13 17:41:42,195 INFO L428 stractBuchiCegarLoop]: Abstraction has 1213 states and 1508 transitions. [2022-12-13 17:41:42,195 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-12-13 17:41:42,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1213 states and 1508 transitions. [2022-12-13 17:41:42,199 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 236 [2022-12-13 17:41:42,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:42,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:42,200 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] [2022-12-13 17:41:42,200 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:42,200 INFO L748 eck$LassoCheckResult]: Stem: 15697#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 15617#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 15618#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; 15624#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 15625#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 15701#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 15702#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 15626#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 15627#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 15718#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 15692#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 15693#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16035#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); 16029#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 16032#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16036#L24 assume ~n#1 < 2; 16033#merge_sortFINAL assume true; 16028#merge_sortEXIT >#87#return; 15600#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 16027#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16026#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); 16018#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 16023#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16025#L24 assume ~n#1 < 2; 16024#merge_sortFINAL assume true; 16017#merge_sortEXIT >#87#return; 15996#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 15997#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 16013#L24 assume ~n#1 < 2; 16014#merge_sortFINAL assume true; 15995#merge_sortEXIT >#89#return; 15994#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 15993#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 15992#L12 assume !(merge_~j~0#1 == merge_~n#1); 15991#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 15989#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 15990#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 16232#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 16231#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 15688#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 15664#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 15632#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 15633#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 16720#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 15956#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 15955#L11-4 merge_~i~0#1 := 0; 15898#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 15602#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 15603#L8 assume { :end_inline_merge } true; 15619#merge_sortFINAL assume true; 15639#merge_sortEXIT >#89#return; 15640#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 16746#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 16744#L12 assume !(merge_~j~0#1 == merge_~n#1); 16743#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 16740#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 16741#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 16754#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 16753#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 16752#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 16750#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 16748#L12 [2022-12-13 17:41:42,200 INFO L750 eck$LassoCheckResult]: Loop: 16748#L12 assume !(merge_~j~0#1 == merge_~n#1); 16747#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 16727#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 16745#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 16721#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 16722#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 16751#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 16749#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 16748#L12 [2022-12-13 17:41:42,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:42,200 INFO L85 PathProgramCache]: Analyzing trace with hash 750594749, now seen corresponding path program 1 times [2022-12-13 17:41:42,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:42,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083103809] [2022-12-13 17:41:42,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:42,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:42,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2022-12-13 17:41:42,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 17:41:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:42,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:41:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:42,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:41:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:42,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:41:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-13 17:41:42,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:41:42,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083103809] [2022-12-13 17:41:42,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083103809] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:41:42,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721379469] [2022-12-13 17:41:42,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:42,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:41:42,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:41:42,312 INFO L229 MonitoredProcess]: Starting monitored process 139 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:41:42,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2022-12-13 17:41:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:41:42,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 17:41:42,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:41:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 17:41:42,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:41:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 17:41:42,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721379469] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:41:42,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:41:42,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 14, 15] total 27 [2022-12-13 17:41:42,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638306949] [2022-12-13 17:41:42,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:41:42,719 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:41:42,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:42,719 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 2 times [2022-12-13 17:41:42,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:42,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794199354] [2022-12-13 17:41:42,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:42,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:42,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:42,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:42,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:41:42,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 17:41:42,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2022-12-13 17:41:42,881 INFO L87 Difference]: Start difference. First operand 1213 states and 1508 transitions. cyclomatic complexity: 372 Second operand has 27 states, 25 states have (on average 3.68) internal successors, (92), 22 states have internal predecessors, (92), 9 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2022-12-13 17:41:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:41:43,742 INFO L93 Difference]: Finished difference Result 2171 states and 2689 transitions. [2022-12-13 17:41:43,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2171 states and 2689 transitions. [2022-12-13 17:41:43,750 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 608 [2022-12-13 17:41:43,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2171 states to 2155 states and 2673 transitions. [2022-12-13 17:41:43,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1585 [2022-12-13 17:41:43,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1585 [2022-12-13 17:41:43,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2155 states and 2673 transitions. [2022-12-13 17:41:43,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:41:43,757 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2155 states and 2673 transitions. [2022-12-13 17:41:43,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states and 2673 transitions. [2022-12-13 17:41:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 1444. [2022-12-13 17:41:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1347 states have (on average 1.1915367483296213) internal successors, (1605), 1350 states have internal predecessors, (1605), 56 states have call successors, (62), 31 states have call predecessors, (62), 41 states have return successors, (121), 62 states have call predecessors, (121), 53 states have call successors, (121) [2022-12-13 17:41:43,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1788 transitions. [2022-12-13 17:41:43,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1444 states and 1788 transitions. [2022-12-13 17:41:43,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 17:41:43,779 INFO L428 stractBuchiCegarLoop]: Abstraction has 1444 states and 1788 transitions. [2022-12-13 17:41:43,779 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-12-13 17:41:43,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1444 states and 1788 transitions. [2022-12-13 17:41:43,783 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 290 [2022-12-13 17:41:43,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:41:43,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:41:43,784 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] [2022-12-13 17:41:43,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:41:43,784 INFO L748 eck$LassoCheckResult]: Stem: 19569#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 19498#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 19499#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; 19507#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 19508#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 19581#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 19582#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 19509#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 19510#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 19607#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 19479#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 19568#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19884#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); 19842#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 19843#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 20033#L24 assume ~n#1 < 2; 20030#merge_sortFINAL assume true; 20027#merge_sortEXIT >#87#return; 19526#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 19553#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 20552#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); 19867#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 19869#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19890#L24 assume ~n#1 < 2; 19889#merge_sortFINAL assume true; 19866#merge_sortEXIT >#87#return; 19542#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 19540#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 19543#L24 assume ~n#1 < 2; 20496#merge_sortFINAL assume true; 20497#merge_sortEXIT >#89#return; 20550#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 20738#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 20737#L12 assume !(merge_~j~0#1 == merge_~n#1); 20736#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 20734#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 20735#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 20559#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 20560#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 19563#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 19564#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 20723#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 20720#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 20716#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 20708#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 20705#L11-4 merge_~i~0#1 := 0; 20704#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 20703#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 20702#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 20701#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 20700#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 20698#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 20696#L8 assume { :end_inline_merge } true; 20694#merge_sortFINAL assume true; 19525#merge_sortEXIT >#89#return; 19517#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 19518#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 20910#L12 assume !(merge_~j~0#1 == merge_~n#1); 20909#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 20907#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 20905#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 20906#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 20901#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 20902#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 20873#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 20872#L12 [2022-12-13 17:41:43,784 INFO L750 eck$LassoCheckResult]: Loop: 20872#L12 assume !(merge_~j~0#1 == merge_~n#1); 19492#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 19493#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 19476#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 19478#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 19570#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 19561#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 19562#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 20872#L12 [2022-12-13 17:41:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:43,784 INFO L85 PathProgramCache]: Analyzing trace with hash 519552441, now seen corresponding path program 1 times [2022-12-13 17:41:43,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:43,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539733546] [2022-12-13 17:41:43,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:43,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:43,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:43,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:43,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:43,848 INFO L85 PathProgramCache]: Analyzing trace with hash 233986997, now seen corresponding path program 3 times [2022-12-13 17:41:43,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:43,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915083906] [2022-12-13 17:41:43,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:43,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:43,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:43,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:43,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:41:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1561125229, now seen corresponding path program 2 times [2022-12-13 17:41:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:41:43,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753444873] [2022-12-13 17:41:43,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:41:43,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:41:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:43,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:41:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:41:43,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:41:58,745 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 17:41:58,745 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 17:41:58,745 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 17:41:58,745 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 17:41:58,745 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 17:41:58,745 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:41:58,745 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 17:41:58,745 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 17:41:58,745 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration17_Lasso [2022-12-13 17:41:58,745 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 17:41:58,745 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 17:41:58,748 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:58,750 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:41:58,751 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,681 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,683 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,684 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,685 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,686 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,687 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,688 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,689 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,690 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,691 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,692 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,693 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,694 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,696 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,697 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,698 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,699 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,700 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,701 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,702 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,703 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,704 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,705 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,706 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,707 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,707 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,708 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:01,709 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:02,803 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 17:42:02,803 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 17:42:02,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:42:02,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:02,804 INFO L229 MonitoredProcess]: Starting monitored process 140 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:42:02,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-12-13 17:42:02,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 [2022-12-13 17:42:02,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:42:02,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:42:02,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:42:02,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:42:02,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:42:02,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:42:02,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:42:02,818 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:42:02,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2022-12-13 17:42:02,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:42:02,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:02,820 INFO L229 MonitoredProcess]: Starting monitored process 141 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:42:02,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-12-13 17:42:02,822 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 [2022-12-13 17:42:02,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:42:02,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:42:02,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:42:02,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:42:02,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:42:02,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:42:02,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:42:02,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:42:02,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2022-12-13 17:42:02,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:42:02,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:02,837 INFO L229 MonitoredProcess]: Starting monitored process 142 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:42:02,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-12-13 17:42:02,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 [2022-12-13 17:42:02,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:42:02,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:42:02,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:42:02,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:42:02,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:42:02,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:42:02,854 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:42:02,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2022-12-13 17:42:02,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:42:02,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:02,857 INFO L229 MonitoredProcess]: Starting monitored process 143 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:42:02,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2022-12-13 17:42:02,860 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 [2022-12-13 17:42:02,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:42:02,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:42:02,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:42:02,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:42:02,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:42:02,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:42:02,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:42:02,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:42:02,873 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2022-12-13 17:42:02,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:42:02,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:02,874 INFO L229 MonitoredProcess]: Starting monitored process 144 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:42:02,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-12-13 17:42:02,876 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 [2022-12-13 17:42:02,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:42:02,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:42:02,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:42:02,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:42:02,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:42:02,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:42:02,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:42:02,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:42:02,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2022-12-13 17:42:02,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:42:02,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:02,891 INFO L229 MonitoredProcess]: Starting monitored process 145 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:42:02,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-12-13 17:42:02,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:42:02,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:42:02,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:42:02,904 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-12-13 17:42:02,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:42:02,981 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2022-12-13 17:42:02,981 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2022-12-13 17:42:05,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 17:42:08,390 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2022-12-13 17:42:08,391 INFO L444 ModelExtractionUtils]: 68 out of 208 variables were initially zero. Simplification set additionally 135 variables to zero. [2022-12-13 17:42:08,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:42:08,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:08,392 INFO L229 MonitoredProcess]: Starting monitored process 146 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:42:08,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-12-13 17:42:08,393 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 17:42:08,406 INFO L438 nArgumentSynthesizer]: Removed 7 redundant supporting invariants from a total of 8. [2022-12-13 17:42:08,407 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 17:42:08,407 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~n#1, merge_sort_merge_~j~0#1) = 1*merge_sort_merge_~n#1 - 1*merge_sort_merge_~j~0#1 Supporting invariants [-1*merge_sort_merge_~i~0#1 >= 0] [2022-12-13 17:42:08,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2022-12-13 17:42:08,650 INFO L156 tatePredicateManager]: 23 out of 26 supporting invariants were superfluous and have been removed [2022-12-13 17:42:08,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:08,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 17:42:08,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:08,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2022-12-13 17:42:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:09,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 17:42:09,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:42:09,393 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.17 stem predicates 3 loop predicates [2022-12-13 17:42:09,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1444 states and 1788 transitions. cyclomatic complexity: 432 Second operand has 21 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 17:42:09,839 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1444 states and 1788 transitions. cyclomatic complexity: 432. Second operand has 21 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Result 1454 states and 1806 transitions. Complement of second has 27 states. [2022-12-13 17:42:09,840 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 [2022-12-13 17:42:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 17:42:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2022-12-13 17:42:09,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 27 transitions. Stem has 65 letters. Loop has 8 letters. [2022-12-13 17:42:09,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:42:09,840 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:42:09,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:09,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 17:42:09,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:10,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 17:42:10,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:42:10,553 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.17 stem predicates 3 loop predicates [2022-12-13 17:42:10,553 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1444 states and 1788 transitions. cyclomatic complexity: 432 Second operand has 21 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 17:42:10,927 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1444 states and 1788 transitions. cyclomatic complexity: 432. Second operand has 21 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Result 1454 states and 1806 transitions. Complement of second has 27 states. [2022-12-13 17:42:10,927 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 [2022-12-13 17:42:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 17:42:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2022-12-13 17:42:10,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 27 transitions. Stem has 65 letters. Loop has 8 letters. [2022-12-13 17:42:10,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:42:10,928 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:42:10,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:11,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 17:42:11,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:11,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 17:42:11,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:42:11,677 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.17 stem predicates 3 loop predicates [2022-12-13 17:42:11,678 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1444 states and 1788 transitions. cyclomatic complexity: 432 Second operand has 21 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 17:42:12,562 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1444 states and 1788 transitions. cyclomatic complexity: 432. Second operand has 21 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Result 1800 states and 2238 transitions. Complement of second has 52 states. [2022-12-13 17:42:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 18 stem states 3 non-accepting loop states 2 accepting loop states [2022-12-13 17:42:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 18 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 17:42:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 172 transitions. [2022-12-13 17:42:12,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 172 transitions. Stem has 65 letters. Loop has 8 letters. [2022-12-13 17:42:12,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:42:12,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 172 transitions. Stem has 73 letters. Loop has 8 letters. [2022-12-13 17:42:12,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:42:12,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 172 transitions. Stem has 65 letters. Loop has 16 letters. [2022-12-13 17:42:12,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:42:12,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1800 states and 2238 transitions. [2022-12-13 17:42:12,572 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 398 [2022-12-13 17:42:12,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1800 states to 1758 states and 2189 transitions. [2022-12-13 17:42:12,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1141 [2022-12-13 17:42:12,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1230 [2022-12-13 17:42:12,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1758 states and 2189 transitions. [2022-12-13 17:42:12,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:42:12,579 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1758 states and 2189 transitions. [2022-12-13 17:42:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states and 2189 transitions. [2022-12-13 17:42:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1590. [2022-12-13 17:42:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1485 states have (on average 1.1912457912457912) internal successors, (1769), 1489 states have internal predecessors, (1769), 60 states have call successors, (67), 33 states have call predecessors, (67), 45 states have return successors, (131), 67 states have call predecessors, (131), 57 states have call successors, (131) [2022-12-13 17:42:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 1967 transitions. [2022-12-13 17:42:12,601 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1590 states and 1967 transitions. [2022-12-13 17:42:12,601 INFO L428 stractBuchiCegarLoop]: Abstraction has 1590 states and 1967 transitions. [2022-12-13 17:42:12,601 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-12-13 17:42:12,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1590 states and 1967 transitions. [2022-12-13 17:42:12,605 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 322 [2022-12-13 17:42:12,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:42:12,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:42:12,606 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:12,606 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 17:42:12,606 INFO L748 eck$LassoCheckResult]: Stem: 26741#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 26670#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 26671#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; 26675#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 26676#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 26677#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 26678#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 26679#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 26780#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 26744#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 26745#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 26746#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 26652#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 26794#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26726#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); 26701#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 26702#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26707#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); 26762#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 26765#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 26768#L24 assume ~n#1 < 2; 26769#merge_sortFINAL assume true; 26760#merge_sortEXIT >#87#return; 26763#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 27022#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 27483#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); 26662#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 26839#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 27212#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); 27027#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 27026#$Ultimate##0 [2022-12-13 17:42:12,606 INFO L750 eck$LassoCheckResult]: Loop: 27026#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 27031#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); 27029#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 27026#$Ultimate##0 [2022-12-13 17:42:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:12,607 INFO L85 PathProgramCache]: Analyzing trace with hash 11293888, now seen corresponding path program 4 times [2022-12-13 17:42:12,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:12,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334303569] [2022-12-13 17:42:12,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:12,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:12,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:42:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 17:42:12,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:12,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334303569] [2022-12-13 17:42:12,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334303569] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:42:12,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258658350] [2022-12-13 17:42:12,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 17:42:12,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:42:12,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:12,856 INFO L229 MonitoredProcess]: Starting monitored process 147 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:42:12,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2022-12-13 17:42:12,928 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 17:42:12,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:42:12,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:42:12,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 17:42:13,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:42:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 17:42:13,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258658350] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:42:13,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:42:13,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 26 [2022-12-13 17:42:13,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808738268] [2022-12-13 17:42:13,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:42:13,154 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:42:13,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 5 times [2022-12-13 17:42:13,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:13,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404970765] [2022-12-13 17:42:13,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:13,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:42:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:13,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:42:13,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:13,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 17:42:13,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2022-12-13 17:42:13,255 INFO L87 Difference]: Start difference. First operand 1590 states and 1967 transitions. cyclomatic complexity: 474 Second operand has 26 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 10 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 17:42:13,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:13,848 INFO L93 Difference]: Finished difference Result 1501 states and 1867 transitions. [2022-12-13 17:42:13,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1501 states and 1867 transitions. [2022-12-13 17:42:13,854 INFO L131 ngComponentsAnalysis]: Automaton has 71 accepting balls. 526 [2022-12-13 17:42:13,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1501 states to 1483 states and 1847 transitions. [2022-12-13 17:42:13,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1319 [2022-12-13 17:42:13,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1331 [2022-12-13 17:42:13,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1483 states and 1847 transitions. [2022-12-13 17:42:13,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:42:13,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1483 states and 1847 transitions. [2022-12-13 17:42:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states and 1847 transitions. [2022-12-13 17:42:13,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 888. [2022-12-13 17:42:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 819 states have (on average 1.188034188034188) internal successors, (973), 819 states have internal predecessors, (973), 44 states have call successors, (46), 28 states have call predecessors, (46), 25 states have return successors, (78), 40 states have call predecessors, (78), 40 states have call successors, (78) [2022-12-13 17:42:13,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1097 transitions. [2022-12-13 17:42:13,887 INFO L240 hiAutomatonCegarLoop]: Abstraction has 888 states and 1097 transitions. [2022-12-13 17:42:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 17:42:13,888 INFO L428 stractBuchiCegarLoop]: Abstraction has 888 states and 1097 transitions. [2022-12-13 17:42:13,888 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-12-13 17:42:13,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 888 states and 1097 transitions. [2022-12-13 17:42:13,891 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 232 [2022-12-13 17:42:13,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:42:13,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:42:13,892 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:13,892 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:13,892 INFO L748 eck$LassoCheckResult]: Stem: 30078#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 30024#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 30025#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; 30027#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 30028#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 30083#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 30084#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 30029#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 30030#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 30088#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 30007#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 30074#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30143#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); 30139#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 30140#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30144#L24 assume ~n#1 < 2; 30142#merge_sortFINAL assume true; 30138#merge_sortEXIT >#87#return; 30010#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 30135#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30185#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); 30177#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 30178#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30183#L24 assume ~n#1 < 2; 30184#merge_sortFINAL assume true; 30176#merge_sortEXIT >#87#return; 30172#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 30173#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 30175#L24 assume ~n#1 < 2; 30174#merge_sortFINAL assume true; 30171#merge_sortEXIT >#89#return; 30170#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 30169#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 30168#L12 assume !(merge_~j~0#1 == merge_~n#1); 30167#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 30165#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 30166#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 30212#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 30210#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 30071#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 30057#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 30058#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 30203#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 30204#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 30154#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 30153#L11-4 merge_~i~0#1 := 0; 30152#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 30151#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 30150#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 30149#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 30148#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 30147#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 30146#L8 assume { :end_inline_merge } true; 30145#merge_sortFINAL assume true; 30134#merge_sortEXIT >#89#return; 30133#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 30132#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 30129#L12 assume !(merge_~j~0#1 == merge_~n#1); 30130#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 30866#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 30863#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 30862#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 30861#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 30860#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 30055#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 30056#L12 [2022-12-13 17:42:13,892 INFO L750 eck$LassoCheckResult]: Loop: 30056#L12 assume !(merge_~j~0#1 == merge_~n#1); 30871#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 30021#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 30047#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 30890#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 30889#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 30888#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 30870#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 30056#L12 [2022-12-13 17:42:13,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:13,893 INFO L85 PathProgramCache]: Analyzing trace with hash 576810743, now seen corresponding path program 1 times [2022-12-13 17:42:13,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:13,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951654139] [2022-12-13 17:42:13,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:13,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:13,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:42:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:13,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:42:13,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:13,959 INFO L85 PathProgramCache]: Analyzing trace with hash 291245299, now seen corresponding path program 2 times [2022-12-13 17:42:13,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:13,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979383062] [2022-12-13 17:42:13,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:13,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:13,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:42:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:13,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:42:13,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:13,966 INFO L85 PathProgramCache]: Analyzing trace with hash 607266281, now seen corresponding path program 2 times [2022-12-13 17:42:13,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:13,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624318508] [2022-12-13 17:42:13,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:13,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:14,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 17:42:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:14,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:42:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:14,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:42:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:14,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:42:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 38 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 17:42:14,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:14,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624318508] [2022-12-13 17:42:14,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624318508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:42:14,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568071929] [2022-12-13 17:42:14,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:42:14,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:42:14,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:14,372 INFO L229 MonitoredProcess]: Starting monitored process 148 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:42:14,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2022-12-13 17:42:14,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:42:14,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:42:14,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 17:42:14,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 21 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-13 17:42:14,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:42:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 21 proven. 47 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 17:42:15,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568071929] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:42:15,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:42:15,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 40 [2022-12-13 17:42:15,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970878763] [2022-12-13 17:42:15,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:42:15,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:15,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 17:42:15,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1425, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 17:42:15,377 INFO L87 Difference]: Start difference. First operand 888 states and 1097 transitions. cyclomatic complexity: 260 Second operand has 40 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 29 states have internal predecessors, (116), 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) [2022-12-13 17:42:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:17,537 INFO L93 Difference]: Finished difference Result 1278 states and 1559 transitions. [2022-12-13 17:42:17,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1278 states and 1559 transitions. [2022-12-13 17:42:17,544 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 322 [2022-12-13 17:42:17,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1278 states to 1270 states and 1551 transitions. [2022-12-13 17:42:17,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1114 [2022-12-13 17:42:17,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1130 [2022-12-13 17:42:17,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1270 states and 1551 transitions. [2022-12-13 17:42:17,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:42:17,553 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1270 states and 1551 transitions. [2022-12-13 17:42:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states and 1551 transitions. [2022-12-13 17:42:17,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 838. [2022-12-13 17:42:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 768 states have (on average 1.1549479166666667) internal successors, (887), 767 states have internal predecessors, (887), 45 states have call successors, (47), 28 states have call predecessors, (47), 25 states have return successors, (76), 42 states have call predecessors, (76), 41 states have call successors, (76) [2022-12-13 17:42:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1010 transitions. [2022-12-13 17:42:17,567 INFO L240 hiAutomatonCegarLoop]: Abstraction has 838 states and 1010 transitions. [2022-12-13 17:42:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-13 17:42:17,568 INFO L428 stractBuchiCegarLoop]: Abstraction has 838 states and 1010 transitions. [2022-12-13 17:42:17,568 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-12-13 17:42:17,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 838 states and 1010 transitions. [2022-12-13 17:42:17,570 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 193 [2022-12-13 17:42:17,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:42:17,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:42:17,571 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:17,571 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-12-13 17:42:17,571 INFO L748 eck$LassoCheckResult]: Stem: 32864#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 32802#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 32803#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; 32805#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 32806#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 32910#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 32909#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 32908#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 32907#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 32904#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 32790#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 32900#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 32896#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); 32887#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 32889#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 32898#L24 assume ~n#1 < 2; 32894#merge_sortFINAL assume true; 32886#merge_sortEXIT >#87#return; 32881#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 32882#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 32993#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); 32988#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 32989#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 32994#L24 assume ~n#1 < 2; 32992#merge_sortFINAL assume true; 32987#merge_sortEXIT >#87#return; 32968#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 32997#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 32998#L24 assume ~n#1 < 2; 32967#merge_sortFINAL assume true; 32969#merge_sortEXIT >#89#return; 33003#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 32958#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 32959#L12 assume !(merge_~j~0#1 == merge_~n#1); 32954#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 32955#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 33002#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 33018#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 33016#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 32931#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 33007#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 33005#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 32930#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 32932#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 32926#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 32927#L11-4 merge_~i~0#1 := 0; 32922#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 32923#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 32983#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 32918#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 32919#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 32911#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 32912#L8 assume { :end_inline_merge } true; 32884#merge_sortFINAL assume true; 32885#merge_sortEXIT >#89#return; 32877#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 32875#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 32871#L12 assume !(merge_~j~0#1 == merge_~n#1); 32870#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 32829#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 32793#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 32794#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 32883#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 32878#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 32876#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 32873#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 32812#L12-2 [2022-12-13 17:42:17,571 INFO L750 eck$LassoCheckResult]: Loop: 32812#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 32860#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 32861#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 32811#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 32812#L12-2 [2022-12-13 17:42:17,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:17,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1073743495, now seen corresponding path program 3 times [2022-12-13 17:42:17,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:17,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178561951] [2022-12-13 17:42:17,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:17,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:17,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 17:42:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:17,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:42:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:17,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:42:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:17,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:42:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 16 proven. 27 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 17:42:17,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:17,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178561951] [2022-12-13 17:42:17,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178561951] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:42:17,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572568210] [2022-12-13 17:42:17,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:42:17,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:42:17,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:17,865 INFO L229 MonitoredProcess]: Starting monitored process 149 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:42:17,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2022-12-13 17:42:18,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 17:42:18,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:42:18,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 17:42:18,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 17:42:18,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:42:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 17:42:18,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572568210] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:42:18,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:42:18,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-12-13 17:42:18,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193530946] [2022-12-13 17:42:18,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:42:18,252 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:42:18,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 3 times [2022-12-13 17:42:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:18,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703528151] [2022-12-13 17:42:18,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:18,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:18,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:42:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:18,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:42:18,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:18,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 17:42:18,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2022-12-13 17:42:18,331 INFO L87 Difference]: Start difference. First operand 838 states and 1010 transitions. cyclomatic complexity: 221 Second operand has 22 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 20 states have internal predecessors, (85), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-12-13 17:42:18,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:18,795 INFO L93 Difference]: Finished difference Result 1085 states and 1329 transitions. [2022-12-13 17:42:18,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1085 states and 1329 transitions. [2022-12-13 17:42:18,801 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 261 [2022-12-13 17:42:18,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1085 states to 1085 states and 1329 transitions. [2022-12-13 17:42:18,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 985 [2022-12-13 17:42:18,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 985 [2022-12-13 17:42:18,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1085 states and 1329 transitions. [2022-12-13 17:42:18,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:42:18,811 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1085 states and 1329 transitions. [2022-12-13 17:42:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states and 1329 transitions. [2022-12-13 17:42:18,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 908. [2022-12-13 17:42:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 838 states have (on average 1.1563245823389021) internal successors, (969), 836 states have internal predecessors, (969), 45 states have call successors, (47), 29 states have call predecessors, (47), 25 states have return successors, (76), 42 states have call predecessors, (76), 41 states have call successors, (76) [2022-12-13 17:42:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1092 transitions. [2022-12-13 17:42:18,829 INFO L240 hiAutomatonCegarLoop]: Abstraction has 908 states and 1092 transitions. [2022-12-13 17:42:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 17:42:18,830 INFO L428 stractBuchiCegarLoop]: Abstraction has 908 states and 1092 transitions. [2022-12-13 17:42:18,830 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-12-13 17:42:18,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 908 states and 1092 transitions. [2022-12-13 17:42:18,834 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 219 [2022-12-13 17:42:18,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:42:18,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:42:18,835 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 3, 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] [2022-12-13 17:42:18,835 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 17:42:18,835 INFO L748 eck$LassoCheckResult]: Stem: 35274#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 35221#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 35222#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; 35224#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 35225#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 35317#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 35316#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 35315#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 35314#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 35312#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 35209#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 35307#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35303#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); 35296#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35299#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35305#L24 assume ~n#1 < 2; 35301#merge_sortFINAL assume true; 35295#merge_sortEXIT >#87#return; 35285#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35286#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35426#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); 35424#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 35425#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35428#L24 assume ~n#1 < 2; 35427#merge_sortFINAL assume true; 35423#merge_sortEXIT >#87#return; 35377#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 35414#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 35422#L24 assume ~n#1 < 2; 35376#merge_sortFINAL assume true; 35378#merge_sortEXIT >#89#return; 35413#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 35412#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35411#L12 assume !(merge_~j~0#1 == merge_~n#1); 35410#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 35408#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 35409#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 35419#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 35417#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 35338#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 35416#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35415#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 35337#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 35336#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 35335#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 35334#L11-4 merge_~i~0#1 := 0; 35333#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 35332#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 35331#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 35328#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 35326#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 35327#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 35320#L8 assume { :end_inline_merge } true; 35321#merge_sortFINAL assume true; 35284#merge_sortEXIT >#89#return; 35283#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 35282#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 35279#L12 assume !(merge_~j~0#1 == merge_~n#1); 35281#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 36041#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 36042#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 36082#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 36079#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 36076#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 36073#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 36071#L12 assume !(merge_~j~0#1 == merge_~n#1); 35216#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 35213#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 35271#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 35266#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 35267#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 35269#L11-4 merge_~i~0#1 := 0; 35255#L17-3 [2022-12-13 17:42:18,835 INFO L750 eck$LassoCheckResult]: Loop: 35255#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 35254#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 35255#L17-3 [2022-12-13 17:42:18,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:18,835 INFO L85 PathProgramCache]: Analyzing trace with hash -449494681, now seen corresponding path program 1 times [2022-12-13 17:42:18,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:18,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977702474] [2022-12-13 17:42:18,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:18,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:18,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 17:42:18,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:18,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:42:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:19,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:42:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:19,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:42:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:19,014 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 17:42:19,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:19,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977702474] [2022-12-13 17:42:19,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977702474] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:42:19,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944292656] [2022-12-13 17:42:19,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:19,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:42:19,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:19,016 INFO L229 MonitoredProcess]: Starting monitored process 150 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:42:19,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2022-12-13 17:42:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:19,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:42:19,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 17:42:19,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:42:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 17:42:19,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944292656] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:42:19,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:42:19,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 17 [2022-12-13 17:42:19,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133746416] [2022-12-13 17:42:19,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:42:19,295 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:42:19,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:19,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 4 times [2022-12-13 17:42:19,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:19,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180278279] [2022-12-13 17:42:19,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:19,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:19,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:42:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:19,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:42:19,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 17:42:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-12-13 17:42:19,343 INFO L87 Difference]: Start difference. First operand 908 states and 1092 transitions. cyclomatic complexity: 236 Second operand has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 15 states have internal predecessors, (79), 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) [2022-12-13 17:42:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:19,552 INFO L93 Difference]: Finished difference Result 1016 states and 1214 transitions. [2022-12-13 17:42:19,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1016 states and 1214 transitions. [2022-12-13 17:42:19,557 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 219 [2022-12-13 17:42:19,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1016 states to 1011 states and 1209 transitions. [2022-12-13 17:42:19,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 899 [2022-12-13 17:42:19,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 899 [2022-12-13 17:42:19,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1011 states and 1209 transitions. [2022-12-13 17:42:19,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:42:19,561 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1011 states and 1209 transitions. [2022-12-13 17:42:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states and 1209 transitions. [2022-12-13 17:42:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 948. [2022-12-13 17:42:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 878 states have (on average 1.15375854214123) internal successors, (1013), 876 states have internal predecessors, (1013), 45 states have call successors, (47), 29 states have call predecessors, (47), 25 states have return successors, (76), 42 states have call predecessors, (76), 41 states have call successors, (76) [2022-12-13 17:42:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1136 transitions. [2022-12-13 17:42:19,573 INFO L240 hiAutomatonCegarLoop]: Abstraction has 948 states and 1136 transitions. [2022-12-13 17:42:19,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 17:42:19,574 INFO L428 stractBuchiCegarLoop]: Abstraction has 948 states and 1136 transitions. [2022-12-13 17:42:19,574 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-12-13 17:42:19,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 948 states and 1136 transitions. [2022-12-13 17:42:19,576 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 219 [2022-12-13 17:42:19,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:42:19,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:42:19,576 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 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, 1, 1] [2022-12-13 17:42:19,576 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-12-13 17:42:19,576 INFO L748 eck$LassoCheckResult]: Stem: 37719#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 37661#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 37662#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; 37664#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 37665#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 37724#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 37725#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 37666#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 37667#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 37756#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 37653#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 37753#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37749#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); 37742#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 37745#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37751#L24 assume ~n#1 < 2; 37747#merge_sortFINAL assume true; 37741#merge_sortEXIT >#87#return; 37734#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 37735#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37862#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); 37860#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 37861#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37864#L24 assume ~n#1 < 2; 37863#merge_sortFINAL assume true; 37859#merge_sortEXIT >#87#return; 37820#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 37821#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 37870#L24 assume ~n#1 < 2; 37822#merge_sortFINAL assume true; 37819#merge_sortEXIT >#89#return; 37818#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 37817#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37816#L12 assume !(merge_~j~0#1 == merge_~n#1); 37814#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 37810#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 37804#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 37805#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 37795#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 37781#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 37787#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37788#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 37779#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 37780#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 37775#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 37776#L11-4 merge_~i~0#1 := 0; 37771#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 37772#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 37768#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 37765#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 37763#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 37764#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 37758#L8 assume { :end_inline_merge } true; 37759#merge_sortFINAL assume true; 37733#merge_sortEXIT >#89#return; 37732#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 37731#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 37726#L12 assume !(merge_~j~0#1 == merge_~n#1); 37728#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 38489#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 38487#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 38488#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 38483#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 38484#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 38479#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38480#L12 assume !(merge_~j~0#1 == merge_~n#1); 38475#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 38476#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 38531#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 38530#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 38529#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38527#L12 assume !(merge_~j~0#1 == merge_~n#1); 37655#L13 [2022-12-13 17:42:19,576 INFO L750 eck$LassoCheckResult]: Loop: 37655#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 37656#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 38536#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 38534#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 38535#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 38568#L12 assume !(merge_~j~0#1 == merge_~n#1); 37655#L13 [2022-12-13 17:42:19,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:19,577 INFO L85 PathProgramCache]: Analyzing trace with hash -449494641, now seen corresponding path program 2 times [2022-12-13 17:42:19,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:19,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082902208] [2022-12-13 17:42:19,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:19,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:19,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:42:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:19,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:42:19,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1578483347, now seen corresponding path program 2 times [2022-12-13 17:42:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:19,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168628684] [2022-12-13 17:42:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:19,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:19,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:42:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:19,648 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:42:19,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:19,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1807016543, now seen corresponding path program 3 times [2022-12-13 17:42:19,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:19,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978614542] [2022-12-13 17:42:19,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:19,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:19,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 17:42:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:19,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 17:42:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:19,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:42:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:19,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:42:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 52 proven. 32 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 17:42:19,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:19,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978614542] [2022-12-13 17:42:19,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978614542] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:42:19,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142462578] [2022-12-13 17:42:19,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:42:19,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:42:19,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:19,851 INFO L229 MonitoredProcess]: Starting monitored process 151 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:42:19,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2022-12-13 17:42:20,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 17:42:20,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:42:20,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 17:42:20,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 65 proven. 19 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 17:42:20,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:42:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 65 proven. 19 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 17:42:20,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142462578] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:42:20,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:42:20,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 20 [2022-12-13 17:42:20,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717811556] [2022-12-13 17:42:20,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:42:20,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:20,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-13 17:42:20,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-12-13 17:42:20,259 INFO L87 Difference]: Start difference. First operand 948 states and 1136 transitions. cyclomatic complexity: 240 Second operand has 20 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 18 states have internal predecessors, (91), 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) [2022-12-13 17:42:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:20,462 INFO L93 Difference]: Finished difference Result 1015 states and 1208 transitions. [2022-12-13 17:42:20,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1015 states and 1208 transitions. [2022-12-13 17:42:20,465 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 221 [2022-12-13 17:42:20,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1015 states to 1008 states and 1201 transitions. [2022-12-13 17:42:20,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 894 [2022-12-13 17:42:20,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 910 [2022-12-13 17:42:20,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1008 states and 1201 transitions. [2022-12-13 17:42:20,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:42:20,476 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1008 states and 1201 transitions. [2022-12-13 17:42:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states and 1201 transitions. [2022-12-13 17:42:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 988. [2022-12-13 17:42:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 917 states have (on average 1.1515812431842967) internal successors, (1056), 914 states have internal predecessors, (1056), 46 states have call successors, (48), 29 states have call predecessors, (48), 25 states have return successors, (77), 44 states have call predecessors, (77), 42 states have call successors, (77) [2022-12-13 17:42:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1181 transitions. [2022-12-13 17:42:20,493 INFO L240 hiAutomatonCegarLoop]: Abstraction has 988 states and 1181 transitions. [2022-12-13 17:42:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:42:20,494 INFO L428 stractBuchiCegarLoop]: Abstraction has 988 states and 1181 transitions. [2022-12-13 17:42:20,494 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-12-13 17:42:20,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1181 transitions. [2022-12-13 17:42:20,497 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 219 [2022-12-13 17:42:20,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:42:20,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:42:20,497 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:20,497 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-12-13 17:42:20,497 INFO L748 eck$LassoCheckResult]: Stem: 40236#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 40178#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 40179#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; 40181#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 40182#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 40282#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 40281#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 40280#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 40279#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 40278#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 40277#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 40276#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 40166#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 40272#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 40268#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); 40261#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 40263#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 40275#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); 40400#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 40407#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 40210#L24 assume ~n#1 < 2; 40406#merge_sortFINAL assume true; 40399#merge_sortEXIT >#87#return; 40401#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 40378#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 40437#L24 assume ~n#1 < 2; 40436#merge_sortFINAL assume true; 40434#merge_sortEXIT >#89#return; 40433#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 40432#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 40431#L12 assume !(merge_~j~0#1 == merge_~n#1); 40430#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 40428#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 40429#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 40513#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 40510#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 40503#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 40507#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 40505#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 40502#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 40500#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 40499#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 40498#L11-4 merge_~i~0#1 := 0; 40496#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 40494#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 40493#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 40492#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 40491#L8 assume { :end_inline_merge } true; 40484#merge_sortFINAL assume true; 40483#merge_sortEXIT >#87#return; 40233#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 40482#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 40481#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); 40459#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 40457#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 40462#L24 assume ~n#1 < 2; 40474#merge_sortFINAL assume true; 40475#merge_sortEXIT >#87#return; 40227#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 40463#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 40226#L24 assume ~n#1 < 2; 40228#merge_sortFINAL assume true; 40690#merge_sortEXIT >#89#return; 40691#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 40744#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 40743#L12 assume !(merge_~j~0#1 == merge_~n#1); 40742#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 40741#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 40696#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 40695#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 40694#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 40693#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 40692#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 40456#L12 [2022-12-13 17:42:20,497 INFO L750 eck$LassoCheckResult]: Loop: 40456#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 40732#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 40731#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 40455#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 40456#L12 [2022-12-13 17:42:20,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash -368617148, now seen corresponding path program 4 times [2022-12-13 17:42:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:20,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813721254] [2022-12-13 17:42:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:20,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 17:42:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:20,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:42:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:20,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:42:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:20,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-12-13 17:42:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:20,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-12-13 17:42:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-12-13 17:42:20,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:20,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813721254] [2022-12-13 17:42:20,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813721254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:42:20,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073072549] [2022-12-13 17:42:20,675 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 17:42:20,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:42:20,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:20,676 INFO L229 MonitoredProcess]: Starting monitored process 152 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:42:20,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2022-12-13 17:42:20,853 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 17:42:20,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:42:20,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 17:42:20,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 58 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-13 17:42:20,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:42:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 34 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-12-13 17:42:20,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073072549] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:42:20,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:42:20,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2022-12-13 17:42:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910600241] [2022-12-13 17:42:20,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:42:20,966 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:42:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:20,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1495548, now seen corresponding path program 4 times [2022-12-13 17:42:20,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:20,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489696398] [2022-12-13 17:42:20,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:20,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:20,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:42:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:20,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:42:21,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:21,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 17:42:21,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-12-13 17:42:21,035 INFO L87 Difference]: Start difference. First operand 988 states and 1181 transitions. cyclomatic complexity: 245 Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 13 states have internal predecessors, (63), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-12-13 17:42:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:21,302 INFO L93 Difference]: Finished difference Result 1297 states and 1553 transitions. [2022-12-13 17:42:21,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1297 states and 1553 transitions. [2022-12-13 17:42:21,305 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 291 [2022-12-13 17:42:21,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1297 states to 1297 states and 1553 transitions. [2022-12-13 17:42:21,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1153 [2022-12-13 17:42:21,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1153 [2022-12-13 17:42:21,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1297 states and 1553 transitions. [2022-12-13 17:42:21,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:42:21,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1297 states and 1553 transitions. [2022-12-13 17:42:21,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states and 1553 transitions. [2022-12-13 17:42:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1012. [2022-12-13 17:42:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 941 states have (on average 1.1477151965993624) internal successors, (1080), 938 states have internal predecessors, (1080), 46 states have call successors, (48), 29 states have call predecessors, (48), 25 states have return successors, (77), 44 states have call predecessors, (77), 42 states have call successors, (77) [2022-12-13 17:42:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1205 transitions. [2022-12-13 17:42:21,323 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1012 states and 1205 transitions. [2022-12-13 17:42:21,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 17:42:21,323 INFO L428 stractBuchiCegarLoop]: Abstraction has 1012 states and 1205 transitions. [2022-12-13 17:42:21,323 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-12-13 17:42:21,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1012 states and 1205 transitions. [2022-12-13 17:42:21,326 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 219 [2022-12-13 17:42:21,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:42:21,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:42:21,326 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:42:21,326 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-12-13 17:42:21,327 INFO L748 eck$LassoCheckResult]: Stem: 43043#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 42990#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 42991#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; 42993#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 42994#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43081#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 43080#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43079#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 43078#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43076#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 43077#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 43095#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 42973#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 43092#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43090#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); 42988#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43088#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43094#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); 43173#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43180#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43025#L24 assume ~n#1 < 2; 43179#merge_sortFINAL assume true; 43172#merge_sortEXIT >#87#return; 43174#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 43169#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43245#L24 assume ~n#1 < 2; 43244#merge_sortFINAL assume true; 43242#merge_sortEXIT >#89#return; 43241#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 43240#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43239#L12 assume !(merge_~j~0#1 == merge_~n#1); 43238#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 43236#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 43237#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 43392#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 43391#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43040#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43028#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43029#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 43301#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43300#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43299#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 43298#L11-4 merge_~i~0#1 := 0; 43297#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43296#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43295#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 43293#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 43292#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 43291#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 43288#L8 assume { :end_inline_merge } true; 43283#merge_sortFINAL assume true; 43282#merge_sortEXIT >#87#return; 43251#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 43281#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43279#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); 43267#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 43250#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43280#L24 assume ~n#1 < 2; 43266#merge_sortFINAL assume true; 43269#merge_sortEXIT >#87#return; 43023#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 43022#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 43024#L24 assume ~n#1 < 2; 43038#merge_sortFINAL assume true; 43528#merge_sortEXIT >#89#return; 43529#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 43525#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43526#L12 assume !(merge_~j~0#1 == merge_~n#1); 43521#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 43522#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 43584#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 43536#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 43537#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43532#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43533#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43577#L12 [2022-12-13 17:42:21,327 INFO L750 eck$LassoCheckResult]: Loop: 43577#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 43582#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 43578#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 43576#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 43577#L12 [2022-12-13 17:42:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1457448186, now seen corresponding path program 5 times [2022-12-13 17:42:21,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:21,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541568874] [2022-12-13 17:42:21,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:21,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:21,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:42:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:21,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:42:21,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:21,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1495548, now seen corresponding path program 5 times [2022-12-13 17:42:21,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:21,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024168967] [2022-12-13 17:42:21,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:21,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:21,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:42:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:21,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:42:21,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:21,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1384586623, now seen corresponding path program 6 times [2022-12-13 17:42:21,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:21,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540408183] [2022-12-13 17:42:21,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:21,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 17:42:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:42:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:42:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-12-13 17:42:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 17:42:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:42:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 10 proven. 78 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-13 17:42:21,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:42:21,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540408183] [2022-12-13 17:42:21,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540408183] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:42:21,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816126223] [2022-12-13 17:42:21,946 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 17:42:21,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:42:21,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:42:21,947 INFO L229 MonitoredProcess]: Starting monitored process 153 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:42:21,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2022-12-13 17:42:22,216 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-12-13 17:42:22,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:42:22,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:42:22,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:42:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-12-13 17:42:22,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:42:22,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816126223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:42:22,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 17:42:22,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [22] total 28 [2022-12-13 17:42:22,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982833394] [2022-12-13 17:42:22,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:42:22,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:42:22,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:42:22,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=726, Unknown=0, NotChecked=0, Total=812 [2022-12-13 17:42:22,367 INFO L87 Difference]: Start difference. First operand 1012 states and 1205 transitions. cyclomatic complexity: 245 Second operand has 9 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 17:42:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:42:22,488 INFO L93 Difference]: Finished difference Result 1053 states and 1241 transitions. [2022-12-13 17:42:22,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1053 states and 1241 transitions. [2022-12-13 17:42:22,492 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 215 [2022-12-13 17:42:22,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1053 states to 1013 states and 1196 transitions. [2022-12-13 17:42:22,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 933 [2022-12-13 17:42:22,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 953 [2022-12-13 17:42:22,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1013 states and 1196 transitions. [2022-12-13 17:42:22,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:42:22,496 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1013 states and 1196 transitions. [2022-12-13 17:42:22,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states and 1196 transitions. [2022-12-13 17:42:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 977. [2022-12-13 17:42:22,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 906 states have (on average 1.1379690949227372) internal successors, (1031), 903 states have internal predecessors, (1031), 46 states have call successors, (48), 29 states have call predecessors, (48), 25 states have return successors, (77), 44 states have call predecessors, (77), 42 states have call successors, (77) [2022-12-13 17:42:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1156 transitions. [2022-12-13 17:42:22,506 INFO L240 hiAutomatonCegarLoop]: Abstraction has 977 states and 1156 transitions. [2022-12-13 17:42:22,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:42:22,507 INFO L428 stractBuchiCegarLoop]: Abstraction has 977 states and 1156 transitions. [2022-12-13 17:42:22,507 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2022-12-13 17:42:22,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 977 states and 1156 transitions. [2022-12-13 17:42:22,510 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 203 [2022-12-13 17:42:22,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:42:22,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:42:22,510 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] [2022-12-13 17:42:22,510 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 17:42:22,510 INFO L748 eck$LassoCheckResult]: Stem: 45451#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 45386#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 45387#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; 45389#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 45390#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 45478#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 45477#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 45476#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 45475#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 45473#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 45429#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 45472#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 45470#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); 45467#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 45468#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 45471#L24 assume ~n#1 < 2; 45469#merge_sortFINAL assume true; 45466#merge_sortEXIT >#87#return; 45459#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 45462#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 45584#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); 45581#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 45582#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 45585#L24 assume ~n#1 < 2; 45583#merge_sortFINAL assume true; 45580#merge_sortEXIT >#87#return; 45549#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 45550#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 45579#L24 assume ~n#1 < 2; 45551#merge_sortFINAL assume true; 45548#merge_sortEXIT >#89#return; 45546#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 45547#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 45542#L12 assume !(merge_~j~0#1 == merge_~n#1); 45543#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 45533#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 45534#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 45525#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 45526#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 45573#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 45572#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 45512#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 45513#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 45508#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 45509#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 45504#L11-4 merge_~i~0#1 := 0; 45505#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 45500#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 45501#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 45497#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 45498#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 45492#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 45493#L8 assume { :end_inline_merge } true; 45571#merge_sortFINAL assume true; 45458#merge_sortEXIT >#89#return; 45461#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 46250#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46248#L12 assume !(merge_~j~0#1 == merge_~n#1); 46247#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 46246#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 46245#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 46244#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 46243#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 46242#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 46241#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46239#L12 assume !(merge_~j~0#1 == merge_~n#1); 46238#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 46237#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 46236#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 46235#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 46234#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 46233#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 46232#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 46196#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 46197#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 46192#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 45796#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 45795#L11-4 merge_~i~0#1 := 0; 45428#L17-3 [2022-12-13 17:42:22,510 INFO L750 eck$LassoCheckResult]: Loop: 45428#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 45427#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 45428#L17-3 [2022-12-13 17:42:22,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:22,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1746497660, now seen corresponding path program 7 times [2022-12-13 17:42:22,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:22,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236845259] [2022-12-13 17:42:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:22,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:22,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:42:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:22,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:42:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:22,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 5 times [2022-12-13 17:42:22,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:22,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026833295] [2022-12-13 17:42:22,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:22,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:22,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:42:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:22,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:42:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:42:22,586 INFO L85 PathProgramCache]: Analyzing trace with hash 947963078, now seen corresponding path program 8 times [2022-12-13 17:42:22,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:42:22,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997115398] [2022-12-13 17:42:22,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:42:22,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:42:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:22,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:42:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:42:22,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:42:36,120 WARN L233 SmtUtils]: Spent 9.90s on a formula simplification. DAG size of input: 346 DAG size of output: 299 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:42:52,903 WARN L233 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 194 DAG size of output: 188 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:42:58,083 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 17:42:58,083 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 17:42:58,083 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 17:42:58,083 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 17:42:58,083 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 17:42:58,083 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:42:58,083 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 17:42:58,083 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 17:42:58,083 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration25_Lasso [2022-12-13 17:42:58,083 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 17:42:58,083 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 17:42:58,086 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:42:58,087 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,032 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,033 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,034 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,034 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,035 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,036 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,037 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,038 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,039 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,039 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,040 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,041 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,042 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,043 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,044 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,045 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,045 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,046 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,047 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,048 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,049 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,050 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,051 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,052 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,052 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,053 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,054 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,055 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:07,056 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:43:08,109 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 17:43:08,109 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 17:43:08,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:43:08,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:08,110 INFO L229 MonitoredProcess]: Starting monitored process 154 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:43:08,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2022-12-13 17:43:08,112 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 [2022-12-13 17:43:08,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:43:08,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:43:08,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:43:08,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:43:08,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:43:08,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:43:08,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:43:08,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:43:08,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2022-12-13 17:43:08,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:43:08,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:08,127 INFO L229 MonitoredProcess]: Starting monitored process 155 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:43:08,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2022-12-13 17:43:08,129 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 [2022-12-13 17:43:08,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:43:08,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:43:08,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:43:08,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:43:08,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:43:08,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:43:08,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:43:08,140 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:43:08,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2022-12-13 17:43:08,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:43:08,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:08,143 INFO L229 MonitoredProcess]: Starting monitored process 156 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:43:08,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2022-12-13 17:43:08,145 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 [2022-12-13 17:43:08,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:43:08,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:43:08,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:43:08,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:43:08,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:43:08,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:43:08,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:43:08,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2022-12-13 17:43:08,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:43:08,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:08,190 INFO L229 MonitoredProcess]: Starting monitored process 157 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:43:08,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2022-12-13 17:43:08,193 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 [2022-12-13 17:43:08,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:43:08,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:43:08,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:43:08,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:43:08,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:43:08,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:43:08,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:43:08,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2022-12-13 17:43:08,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:43:08,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:08,213 INFO L229 MonitoredProcess]: Starting monitored process 158 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:43:08,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2022-12-13 17:43:08,215 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 [2022-12-13 17:43:08,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:43:08,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:43:08,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:43:08,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:43:08,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:43:08,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:43:08,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:43:08,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2022-12-13 17:43:08,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:43:08,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:08,233 INFO L229 MonitoredProcess]: Starting monitored process 159 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:43:08,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2022-12-13 17:43:08,235 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 [2022-12-13 17:43:08,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:43:08,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:43:08,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:43:08,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:43:08,246 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:43:08,246 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:43:08,250 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:43:08,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2022-12-13 17:43:08,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:43:08,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:08,253 INFO L229 MonitoredProcess]: Starting monitored process 160 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:43:08,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2022-12-13 17:43:08,255 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 [2022-12-13 17:43:08,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:43:08,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:43:08,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:43:08,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:43:08,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:43:08,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:43:08,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:43:08,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:43:08,269 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2022-12-13 17:43:08,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:43:08,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:08,270 INFO L229 MonitoredProcess]: Starting monitored process 161 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:43:08,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2022-12-13 17:43:08,273 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 [2022-12-13 17:43:08,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:43:08,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:43:08,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:43:08,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:43:08,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:43:08,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:43:08,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:43:08,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:43:08,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2022-12-13 17:43:08,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:43:08,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:08,287 INFO L229 MonitoredProcess]: Starting monitored process 162 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:43:08,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2022-12-13 17:43:08,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:43:08,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:43:08,300 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2022-12-13 17:43:08,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:43:08,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:43:08,306 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2022-12-13 17:43:08,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:43:08,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:43:08,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Ended with exit code 0 [2022-12-13 17:43:08,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:43:08,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:08,326 INFO L229 MonitoredProcess]: Starting monitored process 163 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:43:08,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2022-12-13 17:43:08,328 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 [2022-12-13 17:43:08,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:43:08,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:43:08,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:43:08,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:43:08,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:43:08,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:43:08,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:43:08,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:43:08,342 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2022-12-13 17:43:08,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:43:08,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:08,343 INFO L229 MonitoredProcess]: Starting monitored process 164 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:43:08,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2022-12-13 17:43:08,345 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 [2022-12-13 17:43:08,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:43:08,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:43:08,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:43:08,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:43:08,365 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:43:08,365 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:43:08,403 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 17:43:08,482 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2022-12-13 17:43:08,482 INFO L444 ModelExtractionUtils]: 20 out of 64 variables were initially zero. Simplification set additionally 41 variables to zero. [2022-12-13 17:43:08,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:43:08,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:08,483 INFO L229 MonitoredProcess]: Starting monitored process 165 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:43:08,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2022-12-13 17:43:08,485 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 17:43:08,495 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 17:43:08,496 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 17:43:08,496 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~n#1, merge_sort_merge_~i~0#1) = 1*merge_sort_merge_~n#1 - 1*merge_sort_merge_~i~0#1 Supporting invariants [] [2022-12-13 17:43:08,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2022-12-13 17:43:09,602 INFO L156 tatePredicateManager]: 55 out of 55 supporting invariants were superfluous and have been removed [2022-12-13 17:43:09,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:09,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:43:09,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:43:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:09,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 17:43:09,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:43:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:09,913 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 [2022-12-13 17:43:09,913 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 977 states and 1156 transitions. cyclomatic complexity: 222 Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2022-12-13 17:43:09,948 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 977 states and 1156 transitions. cyclomatic complexity: 222. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 1007 states and 1191 transitions. Complement of second has 9 states. [2022-12-13 17:43:09,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-12-13 17:43:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2022-12-13 17:43:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-13 17:43:09,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 78 letters. Loop has 2 letters. [2022-12-13 17:43:09,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:43:09,950 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:43:09,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:43:10,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:43:10,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2022-12-13 17:43:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 17:43:10,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:43:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:10,231 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 [2022-12-13 17:43:10,231 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 977 states and 1156 transitions. cyclomatic complexity: 222 Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2022-12-13 17:43:10,266 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 977 states and 1156 transitions. cyclomatic complexity: 222. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 1007 states and 1191 transitions. Complement of second has 9 states. [2022-12-13 17:43:10,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-12-13 17:43:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2022-12-13 17:43:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-13 17:43:10,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 78 letters. Loop has 2 letters. [2022-12-13 17:43:10,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:43:10,267 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:43:10,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:43:10,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:43:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 17:43:10,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:43:10,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:43:10,544 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 [2022-12-13 17:43:10,545 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 977 states and 1156 transitions. cyclomatic complexity: 222 Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2022-12-13 17:43:10,574 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 977 states and 1156 transitions. cyclomatic complexity: 222. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 1063 states and 1257 transitions. Complement of second has 11 states. [2022-12-13 17:43:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-12-13 17:43:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) [2022-12-13 17:43:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-13 17:43:10,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 78 letters. Loop has 2 letters. [2022-12-13 17:43:10,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:43:10,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 80 letters. Loop has 2 letters. [2022-12-13 17:43:10,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:43:10,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 78 letters. Loop has 4 letters. [2022-12-13 17:43:10,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:43:10,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1063 states and 1257 transitions. [2022-12-13 17:43:10,579 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 183 [2022-12-13 17:43:10,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1063 states to 921 states and 1085 transitions. [2022-12-13 17:43:10,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 811 [2022-12-13 17:43:10,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 825 [2022-12-13 17:43:10,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 921 states and 1085 transitions. [2022-12-13 17:43:10,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:43:10,583 INFO L218 hiAutomatonCegarLoop]: Abstraction has 921 states and 1085 transitions. [2022-12-13 17:43:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states and 1085 transitions. [2022-12-13 17:43:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 870. [2022-12-13 17:43:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 803 states have (on average 1.13200498132005) internal successors, (909), 800 states have internal predecessors, (909), 43 states have call successors, (45), 27 states have call predecessors, (45), 24 states have return successors, (75), 42 states have call predecessors, (75), 40 states have call successors, (75) [2022-12-13 17:43:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1029 transitions. [2022-12-13 17:43:10,591 INFO L240 hiAutomatonCegarLoop]: Abstraction has 870 states and 1029 transitions. [2022-12-13 17:43:10,591 INFO L428 stractBuchiCegarLoop]: Abstraction has 870 states and 1029 transitions. [2022-12-13 17:43:10,591 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2022-12-13 17:43:10,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 870 states and 1029 transitions. [2022-12-13 17:43:10,593 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 183 [2022-12-13 17:43:10,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:43:10,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:43:10,594 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:10,594 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-12-13 17:43:10,594 INFO L748 eck$LassoCheckResult]: Stem: 50484#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 50436#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 50437#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; 50442#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50443#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50515#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50514#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50513#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50512#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50511#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 50510#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 50508#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 50422#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 50505#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50503#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); 50499#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50501#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50504#L24 assume ~n#1 < 2; 50502#merge_sortFINAL assume true; 50498#merge_sortEXIT >#87#return; 50494#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 50495#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50607#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); 50604#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 50605#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50609#L24 assume ~n#1 < 2; 50608#merge_sortFINAL assume true; 50603#merge_sortEXIT >#87#return; 50580#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 50581#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 50606#L24 assume ~n#1 < 2; 50582#merge_sortFINAL assume true; 50579#merge_sortEXIT >#89#return; 50577#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 50578#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 50573#L12 assume !(merge_~j~0#1 == merge_~n#1); 50574#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 50564#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 50565#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 50556#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 50557#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 50548#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 50549#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 50541#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 50542#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 50537#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 50538#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 50533#L11-4 merge_~i~0#1 := 0; 50534#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50529#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50530#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 50526#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 50527#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 50521#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 50522#L8 assume { :end_inline_merge } true; 50496#merge_sortFINAL assume true; 50497#merge_sortEXIT >#89#return; 50491#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 50490#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 50487#L12 assume !(merge_~j~0#1 == merge_~n#1); 50488#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 51269#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 51268#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 51267#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51266#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51265#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51263#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51261#L12 assume !(merge_~j~0#1 == merge_~n#1); 50432#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 50433#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51229#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51228#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51227#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51225#L12 assume !(merge_~j~0#1 == merge_~n#1); 51226#L13 [2022-12-13 17:43:10,594 INFO L750 eck$LassoCheckResult]: Loop: 51226#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 51258#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 51257#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 51256#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 51255#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 51246#L12 assume !(merge_~j~0#1 == merge_~n#1); 51226#L13 [2022-12-13 17:43:10,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:10,594 INFO L85 PathProgramCache]: Analyzing trace with hash 188394861, now seen corresponding path program 4 times [2022-12-13 17:43:10,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:10,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414278623] [2022-12-13 17:43:10,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:10,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 17:43:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:43:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:43:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:43:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:43:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 34 proven. 28 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-13 17:43:10,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:43:10,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414278623] [2022-12-13 17:43:10,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414278623] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:43:10,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898597177] [2022-12-13 17:43:10,885 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 17:43:10,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:43:10,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:43:10,886 INFO L229 MonitoredProcess]: Starting monitored process 166 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:43:10,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2022-12-13 17:43:11,198 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 17:43:11,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:43:11,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 17:43:11,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:43:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 39 proven. 23 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-13 17:43:11,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:43:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 39 proven. 26 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 17:43:11,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898597177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:43:11,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:43:11,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 23 [2022-12-13 17:43:11,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054954732] [2022-12-13 17:43:11,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:43:11,484 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:43:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:11,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1578483347, now seen corresponding path program 3 times [2022-12-13 17:43:11,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:11,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689943580] [2022-12-13 17:43:11,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:11,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:43:11,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:43:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:43:11,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:43:11,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:43:11,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 17:43:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-12-13 17:43:11,554 INFO L87 Difference]: Start difference. First operand 870 states and 1029 transitions. cyclomatic complexity: 201 Second operand has 23 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 15 states have internal predecessors, (57), 10 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-12-13 17:43:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:43:11,848 INFO L93 Difference]: Finished difference Result 847 states and 1000 transitions. [2022-12-13 17:43:11,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 847 states and 1000 transitions. [2022-12-13 17:43:11,850 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 183 [2022-12-13 17:43:11,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 847 states to 762 states and 907 transitions. [2022-12-13 17:43:11,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 690 [2022-12-13 17:43:11,855 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 690 [2022-12-13 17:43:11,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 762 states and 907 transitions. [2022-12-13 17:43:11,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:43:11,856 INFO L218 hiAutomatonCegarLoop]: Abstraction has 762 states and 907 transitions. [2022-12-13 17:43:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states and 907 transitions. [2022-12-13 17:43:11,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2022-12-13 17:43:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 706 states have (on average 1.1359773371104815) internal successors, (802), 703 states have internal predecessors, (802), 37 states have call successors, (39), 23 states have call predecessors, (39), 19 states have return successors, (66), 35 states have call predecessors, (66), 34 states have call successors, (66) [2022-12-13 17:43:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 907 transitions. [2022-12-13 17:43:11,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 762 states and 907 transitions. [2022-12-13 17:43:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 17:43:11,863 INFO L428 stractBuchiCegarLoop]: Abstraction has 762 states and 907 transitions. [2022-12-13 17:43:11,864 INFO L335 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2022-12-13 17:43:11,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 762 states and 907 transitions. [2022-12-13 17:43:11,865 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 183 [2022-12-13 17:43:11,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:43:11,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:43:11,866 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-13 17:43:11,866 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:43:11,866 INFO L748 eck$LassoCheckResult]: Stem: 52731#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 52686#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 52687#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; 52689#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 52690#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 52691#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 52692#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 52741#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 52740#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 52739#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 52738#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 52736#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 52696#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 52729#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52762#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); 52702#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 52703#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52824#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); 52821#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 52823#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52748#L24 assume ~n#1 < 2; 52822#merge_sortFINAL assume true; 52820#merge_sortEXIT >#87#return; 52814#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 52816#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52819#L24 assume ~n#1 < 2; 52817#merge_sortFINAL assume true; 52811#merge_sortEXIT >#89#return; 52810#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 52809#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 52808#L12 assume !(merge_~j~0#1 == merge_~n#1); 52807#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 52804#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 52802#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 52800#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 52798#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 52796#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 52794#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 52792#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 52791#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 52790#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 52789#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 52788#L11-4 merge_~i~0#1 := 0; 52787#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 52786#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 52785#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 52784#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 52783#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 52782#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 52781#L8 assume { :end_inline_merge } true; 52780#merge_sortFINAL assume true; 52779#merge_sortEXIT >#87#return; 52711#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 52710#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52712#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); 52742#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 52751#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52946#L24 assume ~n#1 < 2; 52932#merge_sortFINAL assume true; 52935#merge_sortEXIT >#87#return; 52724#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 52752#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 52723#L24 assume ~n#1 < 2; 52725#merge_sortFINAL assume true; 53054#merge_sortEXIT >#89#return; 53055#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 53050#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 53048#L12 assume !(merge_~j~0#1 == merge_~n#1); 53044#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 53045#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 53037#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 53034#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 53030#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 53031#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 53101#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 52951#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 52950#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 52949#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 52947#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 52948#L11-4 merge_~i~0#1 := 0; 53131#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 52717#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 52718#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 53069#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 53068#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 53067#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 53066#L8 assume { :end_inline_merge } true; 53065#merge_sortFINAL assume true; 53060#merge_sortEXIT >#89#return; 52701#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 53431#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 53429#L12 assume !(merge_~j~0#1 == merge_~n#1); 53427#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 53408#L14 [2022-12-13 17:43:11,866 INFO L750 eck$LassoCheckResult]: Loop: 53408#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 53425#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 53437#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 53436#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 53435#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 53434#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 53379#L12 assume !(merge_~j~0#1 == merge_~n#1); 53380#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 53408#L14 [2022-12-13 17:43:11,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:11,866 INFO L85 PathProgramCache]: Analyzing trace with hash -694387602, now seen corresponding path program 9 times [2022-12-13 17:43:11,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:11,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619792315] [2022-12-13 17:43:11,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:11,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:43:11,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:43:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:43:11,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:43:11,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:11,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1719620237, now seen corresponding path program 3 times [2022-12-13 17:43:11,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:11,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076447865] [2022-12-13 17:43:11,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:11,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:43:11,955 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:43:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:43:11,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:43:11,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:43:11,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1527016672, now seen corresponding path program 3 times [2022-12-13 17:43:11,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:43:11,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735404905] [2022-12-13 17:43:11,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:43:11,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:43:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:43:12,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:43:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:43:12,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:43:51,415 WARN L233 SmtUtils]: Spent 28.16s on a formula simplification. DAG size of input: 315 DAG size of output: 282 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:44:01,956 WARN L233 SmtUtils]: Spent 7.75s on a formula simplification that was a NOOP. DAG size: 183 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:44:11,767 WARN L233 SmtUtils]: Spent 9.37s on a formula simplification that was a NOOP. DAG size: 189 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:44:23,712 WARN L233 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 183 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:44:32,698 WARN L233 SmtUtils]: Spent 8.98s on a formula simplification. DAG size of input: 236 DAG size of output: 222 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:44:38,453 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 17:44:38,453 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 17:44:38,453 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 17:44:38,453 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 17:44:38,453 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 17:44:38,454 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:38,454 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 17:44:38,454 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 17:44:38,454 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration27_Lasso [2022-12-13 17:44:38,454 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 17:44:38,454 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 17:44:38,458 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,460 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,461 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,461 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,462 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,463 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,464 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,464 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,465 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,467 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,468 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,469 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,470 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,472 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:38,472 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:44,044 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:44,046 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:44,047 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:44,048 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:44,049 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:44,050 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:44,051 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:44,052 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:44,053 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:44,054 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:44,055 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:44,056 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:44,057 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:44:45,570 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 17:44:45,570 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 17:44:45,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,571 INFO L229 MonitoredProcess]: Starting monitored process 167 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2022-12-13 17:44:45,573 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 [2022-12-13 17:44:45,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2022-12-13 17:44:45,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,587 INFO L229 MonitoredProcess]: Starting monitored process 168 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2022-12-13 17:44:45,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 [2022-12-13 17:44:45,599 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2022-12-13 17:44:45,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,604 INFO L229 MonitoredProcess]: Starting monitored process 169 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2022-12-13 17:44:45,606 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 [2022-12-13 17:44:45,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,616 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,616 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,616 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Ended with exit code 0 [2022-12-13 17:44:45,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,621 INFO L229 MonitoredProcess]: Starting monitored process 170 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2022-12-13 17:44:45,623 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 [2022-12-13 17:44:45,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2022-12-13 17:44:45,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,637 INFO L229 MonitoredProcess]: Starting monitored process 171 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2022-12-13 17:44:45,639 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 [2022-12-13 17:44:45,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2022-12-13 17:44:45,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,654 INFO L229 MonitoredProcess]: Starting monitored process 172 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2022-12-13 17:44:45,656 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 [2022-12-13 17:44:45,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2022-12-13 17:44:45,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,671 INFO L229 MonitoredProcess]: Starting monitored process 173 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2022-12-13 17:44:45,673 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 [2022-12-13 17:44:45,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Forceful destruction successful, exit code 0 [2022-12-13 17:44:45,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,688 INFO L229 MonitoredProcess]: Starting monitored process 174 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2022-12-13 17:44:45,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 [2022-12-13 17:44:45,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Forceful destruction successful, exit code 0 [2022-12-13 17:44:45,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,704 INFO L229 MonitoredProcess]: Starting monitored process 175 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2022-12-13 17:44:45,706 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 [2022-12-13 17:44:45,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,718 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:44:45,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:44:45,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2022-12-13 17:44:45,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,723 INFO L229 MonitoredProcess]: Starting monitored process 176 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2022-12-13 17:44:45,725 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 [2022-12-13 17:44:45,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2022-12-13 17:44:45,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,739 INFO L229 MonitoredProcess]: Starting monitored process 177 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2022-12-13 17:44:45,742 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 [2022-12-13 17:44:45,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2022-12-13 17:44:45,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,757 INFO L229 MonitoredProcess]: Starting monitored process 178 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2022-12-13 17:44:45,759 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:44:45,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2022-12-13 17:44:45,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,774 INFO L229 MonitoredProcess]: Starting monitored process 179 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2022-12-13 17:44:45,777 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 [2022-12-13 17:44:45,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:44:45,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:44:45,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2022-12-13 17:44:45,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,793 INFO L229 MonitoredProcess]: Starting monitored process 180 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2022-12-13 17:44:45,795 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 [2022-12-13 17:44:45,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Forceful destruction successful, exit code 0 [2022-12-13 17:44:45,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,810 INFO L229 MonitoredProcess]: Starting monitored process 181 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2022-12-13 17:44:45,812 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 [2022-12-13 17:44:45,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,824 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2022-12-13 17:44:45,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,827 INFO L229 MonitoredProcess]: Starting monitored process 182 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2022-12-13 17:44:45,829 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 [2022-12-13 17:44:45,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:44:45,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:44:45,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2022-12-13 17:44:45,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,848 INFO L229 MonitoredProcess]: Starting monitored process 183 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2022-12-13 17:44:45,851 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 [2022-12-13 17:44:45,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:44:45,864 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:44:45,869 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2022-12-13 17:44:45,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,872 INFO L229 MonitoredProcess]: Starting monitored process 184 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2022-12-13 17:44:45,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:44:45,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:44:45,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:44:45,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2022-12-13 17:44:45,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,895 INFO L229 MonitoredProcess]: Starting monitored process 185 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2022-12-13 17:44:45,897 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 [2022-12-13 17:44:45,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:44:45,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:44:45,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2022-12-13 17:44:45,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,914 INFO L229 MonitoredProcess]: Starting monitored process 186 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2022-12-13 17:44:45,916 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 [2022-12-13 17:44:45,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,931 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:44:45,931 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:44:45,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2022-12-13 17:44:45,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,946 INFO L229 MonitoredProcess]: Starting monitored process 187 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2022-12-13 17:44:45,948 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 [2022-12-13 17:44:45,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2022-12-13 17:44:45,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,963 INFO L229 MonitoredProcess]: Starting monitored process 188 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2022-12-13 17:44:45,965 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 [2022-12-13 17:44:45,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:44:45,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:44:45,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2022-12-13 17:44:45,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,983 INFO L229 MonitoredProcess]: Starting monitored process 189 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:45,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2022-12-13 17:44:45,985 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 [2022-12-13 17:44:45,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:45,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:44:45,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:45,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:45,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:45,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:44:45,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:44:45,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:45,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2022-12-13 17:44:45,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:45,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:45,999 INFO L229 MonitoredProcess]: Starting monitored process 190 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:46,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2022-12-13 17:44:46,001 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 [2022-12-13 17:44:46,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:46,011 INFO L203 nArgumentSynthesizer]: 16 stem disjuncts [2022-12-13 17:44:46,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:44:46,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:46,025 INFO L401 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2022-12-13 17:44:46,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:44:46,064 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:44:46,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Forceful destruction successful, exit code 0 [2022-12-13 17:44:46,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:46,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:46,069 INFO L229 MonitoredProcess]: Starting monitored process 191 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:46,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2022-12-13 17:44:46,071 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 [2022-12-13 17:44:46,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:44:46,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:44:46,081 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-12-13 17:44:46,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:44:46,135 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2022-12-13 17:44:46,135 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2022-12-13 17:44:47,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 17:44:50,831 INFO L443 ModelExtractionUtils]: Simplification made 54 calls to the SMT solver. [2022-12-13 17:44:50,831 INFO L444 ModelExtractionUtils]: 56 out of 190 variables were initially zero. Simplification set additionally 130 variables to zero. [2022-12-13 17:44:50,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:44:50,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:50,832 INFO L229 MonitoredProcess]: Starting monitored process 192 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:44:50,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2022-12-13 17:44:50,834 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 17:44:50,848 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2022-12-13 17:44:50,848 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 17:44:50,848 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length merge_sort_merge_~x~0#1.base)_6, merge_sort_merge_~i~0#1, merge_sort_merge_~a#1.offset) = 2*v_rep(select #length merge_sort_merge_~x~0#1.base)_6 - 4*merge_sort_merge_~i~0#1 - 1*merge_sort_merge_~a#1.offset Supporting invariants [] [2022-12-13 17:44:50,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2022-12-13 17:44:51,114 INFO L156 tatePredicateManager]: 32 out of 33 supporting invariants were superfluous and have been removed [2022-12-13 17:44:51,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:51,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 17:44:51,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:44:51,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2022-12-13 17:44:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:51,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:44:51,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:44:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:44:51,745 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates [2022-12-13 17:44:51,745 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 762 states and 907 transitions. cyclomatic complexity: 184 Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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) [2022-12-13 17:44:51,915 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 762 states and 907 transitions. cyclomatic complexity: 184. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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 776 states and 921 transitions. Complement of second has 16 states. [2022-12-13 17:44:51,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2022-12-13 17:44:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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) [2022-12-13 17:44:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2022-12-13 17:44:51,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 39 transitions. Stem has 93 letters. Loop has 8 letters. [2022-12-13 17:44:51,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:44:51,916 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:44:51,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:52,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 17:44:52,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:44:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:52,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:44:52,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:44:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:44:52,467 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 4 loop predicates [2022-12-13 17:44:52,467 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 762 states and 907 transitions. cyclomatic complexity: 184 Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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) [2022-12-13 17:44:52,626 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 762 states and 907 transitions. cyclomatic complexity: 184. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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 794 states and 939 transitions. Complement of second has 20 states. [2022-12-13 17:44:52,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 4 non-accepting loop states 2 accepting loop states [2022-12-13 17:44:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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) [2022-12-13 17:44:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 45 transitions. [2022-12-13 17:44:52,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 45 transitions. Stem has 93 letters. Loop has 8 letters. [2022-12-13 17:44:52,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:44:52,627 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:44:52,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:52,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 17:44:52,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:44:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:53,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:44:53,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:44:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:44:53,165 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates [2022-12-13 17:44:53,165 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 762 states and 907 transitions. cyclomatic complexity: 184 Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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) [2022-12-13 17:44:53,327 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 762 states and 907 transitions. cyclomatic complexity: 184. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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 1331 states and 1578 transitions. Complement of second has 24 states. [2022-12-13 17:44:53,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2022-12-13 17:44:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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) [2022-12-13 17:44:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-12-13 17:44:53,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 81 transitions. Stem has 93 letters. Loop has 8 letters. [2022-12-13 17:44:53,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:44:53,329 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:44:53,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:53,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 17:44:53,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:44:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:53,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 17:44:53,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:44:53,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:44:53,889 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.6 stem predicates 4 loop predicates [2022-12-13 17:44:53,889 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 762 states and 907 transitions. cyclomatic complexity: 184 Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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) [2022-12-13 17:44:54,088 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 762 states and 907 transitions. cyclomatic complexity: 184. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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 1432 states and 1685 transitions. Complement of second has 38 states. [2022-12-13 17:44:54,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 4 non-accepting loop states 2 accepting loop states [2022-12-13 17:44:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 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) [2022-12-13 17:44:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 89 transitions. [2022-12-13 17:44:54,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 89 transitions. Stem has 93 letters. Loop has 8 letters. [2022-12-13 17:44:54,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:44:54,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 89 transitions. Stem has 101 letters. Loop has 8 letters. [2022-12-13 17:44:54,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:44:54,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 89 transitions. Stem has 93 letters. Loop has 16 letters. [2022-12-13 17:44:54,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:44:54,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1432 states and 1685 transitions. [2022-12-13 17:44:54,094 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 336 [2022-12-13 17:44:54,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1432 states to 1308 states and 1558 transitions. [2022-12-13 17:44:54,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1075 [2022-12-13 17:44:54,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1174 [2022-12-13 17:44:54,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1308 states and 1558 transitions. [2022-12-13 17:44:54,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:44:54,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1308 states and 1558 transitions. [2022-12-13 17:44:54,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states and 1558 transitions. [2022-12-13 17:44:54,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1148. [2022-12-13 17:44:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1078 states have (on average 1.155844155844156) internal successors, (1246), 1072 states have internal predecessors, (1246), 46 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (84), 50 states have call predecessors, (84), 43 states have call successors, (84) [2022-12-13 17:44:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1378 transitions. [2022-12-13 17:44:54,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1148 states and 1378 transitions. [2022-12-13 17:44:54,109 INFO L428 stractBuchiCegarLoop]: Abstraction has 1148 states and 1378 transitions. [2022-12-13 17:44:54,109 INFO L335 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2022-12-13 17:44:54,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1148 states and 1378 transitions. [2022-12-13 17:44:54,112 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 300 [2022-12-13 17:44:54,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:44:54,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:44:54,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-13 17:44:54,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:44:54,113 INFO L748 eck$LassoCheckResult]: Stem: 59397#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 59339#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 59340#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; 59345#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 59346#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 59347#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 59348#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 59349#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 59410#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 59409#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 59408#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 59406#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 59334#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 59396#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59452#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); 59445#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 59450#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59495#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); 59492#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 59494#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59496#L24 assume ~n#1 < 2; 59493#merge_sortFINAL assume true; 59491#merge_sortEXIT >#87#return; 59485#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 59487#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59490#L24 assume ~n#1 < 2; 59488#merge_sortFINAL assume true; 59484#merge_sortEXIT >#89#return; 59483#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 59482#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 59481#L12 assume !(merge_~j~0#1 == merge_~n#1); 59480#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 59477#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 59475#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 59473#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 59471#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 59469#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 59467#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 59465#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 59464#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 59462#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 59461#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 59460#L11-4 merge_~i~0#1 := 0; 59459#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 59458#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 59457#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 59456#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 59455#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 59454#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 59453#L8 assume { :end_inline_merge } true; 59451#merge_sortFINAL assume true; 59444#merge_sortEXIT >#87#return; 59383#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 59424#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59388#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); 59389#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 59634#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59637#L24 assume ~n#1 < 2; 59635#merge_sortFINAL assume true; 59630#merge_sortEXIT >#87#return; 59373#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 59372#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 59374#L24 assume ~n#1 < 2; 59526#merge_sortFINAL assume true; 59757#merge_sortEXIT >#89#return; 59756#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 59755#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 59754#L12 assume !(merge_~j~0#1 == merge_~n#1); 59753#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 59750#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 59748#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 59746#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 59744#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 59742#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 59740#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 59738#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 59737#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 59736#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 59735#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 59732#L11-4 merge_~i~0#1 := 0; 59730#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 59728#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 59726#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 59724#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 59723#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 59720#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 59718#L8 assume { :end_inline_merge } true; 59716#merge_sortFINAL assume true; 59712#merge_sortEXIT >#89#return; 59423#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 59417#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 59418#L12 assume !(merge_~j~0#1 == merge_~n#1); 59413#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 59414#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 59370#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 60470#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 60469#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 60449#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 60447#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 60446#L12 assume !(merge_~j~0#1 == merge_~n#1); 60444#L13 [2022-12-13 17:44:54,113 INFO L750 eck$LassoCheckResult]: Loop: 60444#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 60433#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 60443#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 60457#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 60455#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 60453#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 60451#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 60445#L12 assume !(merge_~j~0#1 == merge_~n#1); 60444#L13 [2022-12-13 17:44:54,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:54,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2015029207, now seen corresponding path program 10 times [2022-12-13 17:44:54,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:44:54,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84695488] [2022-12-13 17:44:54,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:54,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:44:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:44:54,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:44:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:44:54,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:44:54,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:54,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1157927731, now seen corresponding path program 4 times [2022-12-13 17:44:54,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:44:54,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720110718] [2022-12-13 17:44:54,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:54,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:44:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:44:54,211 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:44:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:44:54,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:44:54,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:54,215 INFO L85 PathProgramCache]: Analyzing trace with hash 712253091, now seen corresponding path program 11 times [2022-12-13 17:44:54,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:44:54,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385770561] [2022-12-13 17:44:54,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:54,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:44:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:54,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-12-13 17:44:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:54,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:44:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:54,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:44:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:54,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-12-13 17:44:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:54,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:44:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:44:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:44:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 65 proven. 43 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-12-13 17:44:54,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:44:54,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385770561] [2022-12-13 17:44:54,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385770561] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:44:54,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790075991] [2022-12-13 17:44:54,733 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 17:44:54,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:44:54,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:44:54,734 INFO L229 MonitoredProcess]: Starting monitored process 193 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:44:54,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (193)] Waiting until timeout for monitored process [2022-12-13 17:44:55,410 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-12-13 17:44:55,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:44:55,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 17:44:55,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:44:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 100 proven. 57 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-12-13 17:44:55,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:44:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 117 proven. 40 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-12-13 17:44:56,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790075991] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:44:56,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:44:56,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-12-13 17:44:56,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429644067] [2022-12-13 17:44:56,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:44:56,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:44:56,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 17:44:56,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2022-12-13 17:44:56,373 INFO L87 Difference]: Start difference. First operand 1148 states and 1378 transitions. cyclomatic complexity: 292 Second operand has 35 states, 31 states have (on average 3.2580645161290325) internal successors, (101), 30 states have internal predecessors, (101), 7 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-12-13 17:44:58,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:44:58,494 INFO L93 Difference]: Finished difference Result 2042 states and 2445 transitions. [2022-12-13 17:44:58,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2042 states and 2445 transitions. [2022-12-13 17:44:58,506 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 360 [2022-12-13 17:44:58,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2042 states to 2042 states and 2445 transitions. [2022-12-13 17:44:58,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1762 [2022-12-13 17:44:58,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1762 [2022-12-13 17:44:58,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2042 states and 2445 transitions. [2022-12-13 17:44:58,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:44:58,512 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2042 states and 2445 transitions. [2022-12-13 17:44:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states and 2445 transitions. [2022-12-13 17:44:58,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1441. [2022-12-13 17:44:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1371 states have (on average 1.1458789204959883) internal successors, (1571), 1357 states have internal predecessors, (1571), 46 states have call successors, (48), 25 states have call predecessors, (48), 24 states have return successors, (84), 58 states have call predecessors, (84), 43 states have call successors, (84) [2022-12-13 17:44:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 1703 transitions. [2022-12-13 17:44:58,526 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1441 states and 1703 transitions. [2022-12-13 17:44:58,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-12-13 17:44:58,527 INFO L428 stractBuchiCegarLoop]: Abstraction has 1441 states and 1703 transitions. [2022-12-13 17:44:58,527 INFO L335 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2022-12-13 17:44:58,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1441 states and 1703 transitions. [2022-12-13 17:44:58,529 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 268 [2022-12-13 17:44:58,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:44:58,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:44:58,530 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-13 17:44:58,530 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:44:58,530 INFO L748 eck$LassoCheckResult]: Stem: 63458#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 63396#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 63397#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; 63402#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 63403#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 63404#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 63405#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 63406#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 63464#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 63462#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 63463#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 63466#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 63384#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 63456#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 63482#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); 63477#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 63480#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 63524#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); 63521#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 63523#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 63437#L24 assume ~n#1 < 2; 63522#merge_sortFINAL assume true; 63520#merge_sortEXIT >#87#return; 63514#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 63516#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 63519#L24 assume ~n#1 < 2; 63517#merge_sortFINAL assume true; 63513#merge_sortEXIT >#89#return; 63512#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 63511#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 63510#L12 assume !(merge_~j~0#1 == merge_~n#1); 63509#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 63506#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 63504#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 63502#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 63500#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 63498#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 63496#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 63494#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 63493#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 63492#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 63491#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 63490#L11-4 merge_~i~0#1 := 0; 63489#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 63488#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 63487#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 63486#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 63485#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 63484#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 63483#L8 assume { :end_inline_merge } true; 63481#merge_sortFINAL assume true; 63476#merge_sortEXIT >#87#return; 63443#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 63577#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 63575#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); 63431#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 63422#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 63432#L24 assume ~n#1 < 2; 63559#merge_sortFINAL assume true; 63571#merge_sortEXIT >#87#return; 63442#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 63444#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 63449#L24 assume ~n#1 < 2; 63450#merge_sortFINAL assume true; 63774#merge_sortEXIT >#89#return; 63773#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 63772#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 63771#L12 assume !(merge_~j~0#1 == merge_~n#1); 63770#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 63767#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 63765#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 63763#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 63761#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 63759#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 63757#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 63755#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 63754#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 63753#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 63752#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 63751#L11-4 merge_~i~0#1 := 0; 63750#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 63749#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 63748#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 63747#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 63746#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 63745#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 63744#L8 assume { :end_inline_merge } true; 63743#merge_sortFINAL assume true; 63741#merge_sortEXIT >#89#return; 63471#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 63470#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 63469#L12 assume !(merge_~j~0#1 == merge_~n#1); 63468#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 63467#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 63429#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 64811#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 64810#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 64809#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 64808#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 64807#L12 assume !(merge_~j~0#1 == merge_~n#1); 64778#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 63427#L14 [2022-12-13 17:44:58,530 INFO L750 eck$LassoCheckResult]: Loop: 63427#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 63428#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 64806#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 64805#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 64804#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 64803#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 64801#L12 assume !(merge_~j~0#1 == merge_~n#1); 64802#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 63427#L14 [2022-12-13 17:44:58,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:58,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1958603998, now seen corresponding path program 12 times [2022-12-13 17:44:58,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:44:58,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710700734] [2022-12-13 17:44:58,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:58,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:44:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:44:58,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:44:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:44:58,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:44:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:58,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1719620237, now seen corresponding path program 4 times [2022-12-13 17:44:58,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:44:58,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960420771] [2022-12-13 17:44:58,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:58,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:44:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:44:58,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:44:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:44:58,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:44:58,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:44:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash -204337260, now seen corresponding path program 4 times [2022-12-13 17:44:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:44:58,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980076412] [2022-12-13 17:44:58,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:44:58,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:44:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:44:58,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:44:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:44:58,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:45:25,860 WARN L233 SmtUtils]: Spent 19.60s on a formula simplification. DAG size of input: 354 DAG size of output: 306 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:45:36,635 WARN L233 SmtUtils]: Spent 8.91s on a formula simplification that was a NOOP. DAG size: 186 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:45:42,215 WARN L233 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 192 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:45:49,111 WARN L233 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 186 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:46:01,732 WARN L233 SmtUtils]: Spent 12.62s on a formula simplification. DAG size of input: 234 DAG size of output: 227 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:46:08,361 WARN L233 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 217 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:46:08,366 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 17:46:08,366 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 17:46:08,366 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 17:46:08,366 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 17:46:08,366 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 17:46:08,366 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:08,366 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 17:46:08,366 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 17:46:08,366 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration29_Lasso [2022-12-13 17:46:08,366 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 17:46:08,366 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 17:46:08,369 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,370 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,371 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,373 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,374 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,375 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,376 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,377 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,377 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,379 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,380 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,381 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,382 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,383 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,384 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,385 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,386 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,387 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,388 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,389 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,390 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:08,391 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:17,544 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:17,545 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:17,546 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:17,547 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:17,548 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:17,548 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:17,549 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:46:19,681 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 17:46:19,681 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 17:46:19,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,682 INFO L229 MonitoredProcess]: Starting monitored process 194 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2022-12-13 17:46:19,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 [2022-12-13 17:46:19,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2022-12-13 17:46:19,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,699 INFO L229 MonitoredProcess]: Starting monitored process 195 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2022-12-13 17:46:19,701 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 [2022-12-13 17:46:19,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2022-12-13 17:46:19,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,716 INFO L229 MonitoredProcess]: Starting monitored process 196 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2022-12-13 17:46:19,718 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 [2022-12-13 17:46:19,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2022-12-13 17:46:19,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,732 INFO L229 MonitoredProcess]: Starting monitored process 197 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2022-12-13 17:46:19,734 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 [2022-12-13 17:46:19,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Ended with exit code 0 [2022-12-13 17:46:19,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,749 INFO L229 MonitoredProcess]: Starting monitored process 198 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2022-12-13 17:46:19,751 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 [2022-12-13 17:46:19,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,761 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2022-12-13 17:46:19,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,766 INFO L229 MonitoredProcess]: Starting monitored process 199 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2022-12-13 17:46:19,768 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 [2022-12-13 17:46:19,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2022-12-13 17:46:19,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,783 INFO L229 MonitoredProcess]: Starting monitored process 200 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2022-12-13 17:46:19,785 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 [2022-12-13 17:46:19,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2022-12-13 17:46:19,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,799 INFO L229 MonitoredProcess]: Starting monitored process 201 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2022-12-13 17:46:19,801 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 [2022-12-13 17:46:19,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2022-12-13 17:46:19,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,816 INFO L229 MonitoredProcess]: Starting monitored process 202 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2022-12-13 17:46:19,818 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 [2022-12-13 17:46:19,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:46:19,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:46:19,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Ended with exit code 0 [2022-12-13 17:46:19,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,834 INFO L229 MonitoredProcess]: Starting monitored process 203 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2022-12-13 17:46:19,836 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 [2022-12-13 17:46:19,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2022-12-13 17:46:19,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,850 INFO L229 MonitoredProcess]: Starting monitored process 204 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2022-12-13 17:46:19,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 [2022-12-13 17:46:19,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2022-12-13 17:46:19,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,868 INFO L229 MonitoredProcess]: Starting monitored process 205 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2022-12-13 17:46:19,870 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 [2022-12-13 17:46:19,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:46:19,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:46:19,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2022-12-13 17:46:19,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,886 INFO L229 MonitoredProcess]: Starting monitored process 206 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2022-12-13 17:46:19,888 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 [2022-12-13 17:46:19,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Forceful destruction successful, exit code 0 [2022-12-13 17:46:19,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,902 INFO L229 MonitoredProcess]: Starting monitored process 207 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2022-12-13 17:46:19,904 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 [2022-12-13 17:46:19,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2022-12-13 17:46:19,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,919 INFO L229 MonitoredProcess]: Starting monitored process 208 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2022-12-13 17:46:19,921 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 [2022-12-13 17:46:19,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2022-12-13 17:46:19,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,935 INFO L229 MonitoredProcess]: Starting monitored process 209 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2022-12-13 17:46:19,937 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 [2022-12-13 17:46:19,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,951 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2022-12-13 17:46:19,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,952 INFO L229 MonitoredProcess]: Starting monitored process 210 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2022-12-13 17:46:19,954 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 [2022-12-13 17:46:19,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2022-12-13 17:46:19,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,968 INFO L229 MonitoredProcess]: Starting monitored process 211 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2022-12-13 17:46:19,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 [2022-12-13 17:46:19,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:19,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Ended with exit code 0 [2022-12-13 17:46:19,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:19,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:19,985 INFO L229 MonitoredProcess]: Starting monitored process 212 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:19,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2022-12-13 17:46:19,987 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 [2022-12-13 17:46:19,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:19,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:19,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:19,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:19,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:19,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:19,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:19,998 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:20,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2022-12-13 17:46:20,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:20,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:20,001 INFO L229 MonitoredProcess]: Starting monitored process 213 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:20,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2022-12-13 17:46:20,003 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 [2022-12-13 17:46:20,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:20,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:20,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:20,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:20,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:20,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:20,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:20,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:20,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2022-12-13 17:46:20,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:20,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:20,018 INFO L229 MonitoredProcess]: Starting monitored process 214 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:20,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2022-12-13 17:46:20,020 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 [2022-12-13 17:46:20,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:20,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:46:20,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:20,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:46:20,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:20,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:46:20,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:46:20,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:46:20,034 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Ended with exit code 0 [2022-12-13 17:46:20,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:20,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:20,035 INFO L229 MonitoredProcess]: Starting monitored process 215 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:20,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2022-12-13 17:46:20,037 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 [2022-12-13 17:46:20,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:46:20,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:46:20,048 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2022-12-13 17:46:20,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:46:20,113 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2022-12-13 17:46:20,113 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2022-12-13 17:46:21,186 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 17:46:23,202 INFO L443 ModelExtractionUtils]: Simplification made 79 calls to the SMT solver. [2022-12-13 17:46:23,203 INFO L444 ModelExtractionUtils]: 80 out of 190 variables were initially zero. Simplification set additionally 106 variables to zero. [2022-12-13 17:46:23,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:46:23,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:23,204 INFO L229 MonitoredProcess]: Starting monitored process 216 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:46:23,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2022-12-13 17:46:23,205 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 17:46:23,218 INFO L438 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2022-12-13 17:46:23,219 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 17:46:23,219 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_merge_~i~0#1, v_rep(select #length merge_sort_merge_~a#1.base)_7, merge_sort_merge_~m#1) = -4*merge_sort_merge_~i~0#1 + 1*v_rep(select #length merge_sort_merge_~a#1.base)_7 + 4*merge_sort_merge_~m#1 Supporting invariants [] [2022-12-13 17:46:23,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2022-12-13 17:46:23,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Ended with exit code 0 [2022-12-13 17:46:23,871 INFO L156 tatePredicateManager]: 57 out of 58 supporting invariants were superfluous and have been removed [2022-12-13 17:46:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:46:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:23,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-13 17:46:23,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:46:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:24,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:46:24,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:46:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:46:24,877 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.20 stem predicates 2 loop predicates [2022-12-13 17:46:24,877 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1441 states and 1703 transitions. cyclomatic complexity: 322 Second operand has 22 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:46:25,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1441 states and 1703 transitions. cyclomatic complexity: 322. Second operand has 22 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Result 1453 states and 1714 transitions. Complement of second has 29 states. [2022-12-13 17:46:25,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 20 stem states 0 non-accepting loop states 1 accepting loop states [2022-12-13 17:46:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:46:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 42 transitions. [2022-12-13 17:46:25,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 42 transitions. Stem has 101 letters. Loop has 8 letters. [2022-12-13 17:46:25,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:46:25,610 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:46:25,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:46:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:25,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-13 17:46:25,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:46:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:26,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:46:26,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:46:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:46:26,592 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.20 stem predicates 2 loop predicates [2022-12-13 17:46:26,592 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1441 states and 1703 transitions. cyclomatic complexity: 322 Second operand has 22 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:46:27,325 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1441 states and 1703 transitions. cyclomatic complexity: 322. Second operand has 22 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Result 1453 states and 1714 transitions. Complement of second has 29 states. [2022-12-13 17:46:27,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 20 stem states 0 non-accepting loop states 1 accepting loop states [2022-12-13 17:46:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:46:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 42 transitions. [2022-12-13 17:46:27,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 42 transitions. Stem has 101 letters. Loop has 8 letters. [2022-12-13 17:46:27,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:46:27,326 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:46:27,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:46:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:27,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-13 17:46:27,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:46:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:28,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:46:28,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:46:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:46:28,440 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.20 stem predicates 2 loop predicates [2022-12-13 17:46:28,440 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1441 states and 1703 transitions. cyclomatic complexity: 322 Second operand has 22 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:46:29,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1441 states and 1703 transitions. cyclomatic complexity: 322. Second operand has 22 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Result 1617 states and 1888 transitions. Complement of second has 36 states. [2022-12-13 17:46:29,472 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 [2022-12-13 17:46:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 17:46:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 120 transitions. [2022-12-13 17:46:29,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 120 transitions. Stem has 101 letters. Loop has 8 letters. [2022-12-13 17:46:29,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:46:29,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 120 transitions. Stem has 109 letters. Loop has 8 letters. [2022-12-13 17:46:29,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:46:29,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 120 transitions. Stem has 101 letters. Loop has 16 letters. [2022-12-13 17:46:29,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:46:29,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1617 states and 1888 transitions. [2022-12-13 17:46:29,482 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 268 [2022-12-13 17:46:29,491 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1617 states to 1435 states and 1690 transitions. [2022-12-13 17:46:29,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1176 [2022-12-13 17:46:29,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1289 [2022-12-13 17:46:29,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1435 states and 1690 transitions. [2022-12-13 17:46:29,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:46:29,492 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1435 states and 1690 transitions. [2022-12-13 17:46:29,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states and 1690 transitions. [2022-12-13 17:46:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1425. [2022-12-13 17:46:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 1362 states have (on average 1.146108663729809) internal successors, (1561), 1349 states have internal predecessors, (1561), 39 states have call successors, (41), 20 states have call predecessors, (41), 24 states have return successors, (78), 55 states have call predecessors, (78), 37 states have call successors, (78) [2022-12-13 17:46:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1680 transitions. [2022-12-13 17:46:29,506 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1425 states and 1680 transitions. [2022-12-13 17:46:29,506 INFO L428 stractBuchiCegarLoop]: Abstraction has 1425 states and 1680 transitions. [2022-12-13 17:46:29,506 INFO L335 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2022-12-13 17:46:29,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1425 states and 1680 transitions. [2022-12-13 17:46:29,511 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 268 [2022-12-13 17:46:29,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:46:29,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:46:29,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 4, 4, 3, 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] [2022-12-13 17:46:29,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-12-13 17:46:29,512 INFO L748 eck$LassoCheckResult]: Stem: 70912#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 70848#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 70849#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; 70851#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 70852#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 70853#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 70854#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 70855#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 70921#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 70920#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 70919#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 70917#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 70918#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 70977#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 70835#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 70909#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 70942#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); 70886#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 70871#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 70887#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); 70901#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 70938#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 70941#L24 assume ~n#1 < 2; 70940#merge_sortFINAL assume true; 70935#merge_sortEXIT >#87#return; 70842#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 70965#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 70964#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); 70937#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 70939#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 70960#L24 assume ~n#1 < 2; 70959#merge_sortFINAL assume true; 70936#merge_sortEXIT >#87#return; 70865#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 70930#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 70898#L24 assume ~n#1 < 2; 70864#merge_sortFINAL assume true; 70866#merge_sortEXIT >#89#return; 71326#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 71325#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 71324#L12 assume !(merge_~j~0#1 == merge_~n#1); 71323#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 71321#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 71322#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 71338#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 71334#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 71331#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 71327#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 71312#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 71250#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 71251#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 71241#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 71242#L11-4 merge_~i~0#1 := 0; 70895#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 70896#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 70897#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 70891#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 70892#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 70840#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 70843#L8 assume { :end_inline_merge } true; 70850#merge_sortFINAL assume true; 70861#merge_sortEXIT >#89#return; 70863#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 72154#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 72151#L12 assume !(merge_~j~0#1 == merge_~n#1); 72148#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 72141#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 72138#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 72135#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 72132#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 72129#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 72125#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 72121#L12 assume !(merge_~j~0#1 == merge_~n#1); 72118#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 72042#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 72043#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 72039#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 72031#L12-2 [2022-12-13 17:46:29,512 INFO L750 eck$LassoCheckResult]: Loop: 72031#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 72033#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 72032#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 72030#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 72031#L12-2 [2022-12-13 17:46:29,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:46:29,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1498883808, now seen corresponding path program 13 times [2022-12-13 17:46:29,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:46:29,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080393980] [2022-12-13 17:46:29,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:46:29,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:46:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:29,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-12-13 17:46:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:29,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-12-13 17:46:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:29,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:46:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:29,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:46:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 33 proven. 46 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 17:46:29,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:46:29,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080393980] [2022-12-13 17:46:29,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080393980] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:46:29,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595140262] [2022-12-13 17:46:29,916 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 17:46:29,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:46:29,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:29,917 INFO L229 MonitoredProcess]: Starting monitored process 217 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:46:29,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (217)] Waiting until timeout for monitored process [2022-12-13 17:46:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:30,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 17:46:30,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:46:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 32 proven. 47 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 17:46:30,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:46:30,326 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 32 proven. 47 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 17:46:30,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595140262] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:46:30,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:46:30,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 24 [2022-12-13 17:46:30,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399437436] [2022-12-13 17:46:30,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:46:30,327 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:46:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:46:30,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 6 times [2022-12-13 17:46:30,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:46:30,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389498163] [2022-12-13 17:46:30,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:46:30,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:46:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:46:30,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:46:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:46:30,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:46:30,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:46:30,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 17:46:30,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-12-13 17:46:30,417 INFO L87 Difference]: Start difference. First operand 1425 states and 1680 transitions. cyclomatic complexity: 315 Second operand has 24 states, 19 states have (on average 3.210526315789474) internal successors, (61), 21 states have internal predecessors, (61), 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) [2022-12-13 17:46:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:46:30,818 INFO L93 Difference]: Finished difference Result 1676 states and 1966 transitions. [2022-12-13 17:46:30,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1676 states and 1966 transitions. [2022-12-13 17:46:30,825 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 309 [2022-12-13 17:46:30,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1676 states to 1601 states and 1882 transitions. [2022-12-13 17:46:30,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1427 [2022-12-13 17:46:30,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1433 [2022-12-13 17:46:30,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1601 states and 1882 transitions. [2022-12-13 17:46:30,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:46:30,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1601 states and 1882 transitions. [2022-12-13 17:46:30,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states and 1882 transitions. [2022-12-13 17:46:30,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1466. [2022-12-13 17:46:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1466 states, 1398 states have (on average 1.1437768240343347) internal successors, (1599), 1385 states have internal predecessors, (1599), 43 states have call successors, (45), 23 states have call predecessors, (45), 25 states have return successors, (81), 57 states have call predecessors, (81), 40 states have call successors, (81) [2022-12-13 17:46:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1725 transitions. [2022-12-13 17:46:30,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1466 states and 1725 transitions. [2022-12-13 17:46:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 17:46:30,848 INFO L428 stractBuchiCegarLoop]: Abstraction has 1466 states and 1725 transitions. [2022-12-13 17:46:30,848 INFO L335 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2022-12-13 17:46:30,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1466 states and 1725 transitions. [2022-12-13 17:46:30,851 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 268 [2022-12-13 17:46:30,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:46:30,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:46:30,852 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-13 17:46:30,852 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:46:30,852 INFO L748 eck$LassoCheckResult]: Stem: 74576#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 74509#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 74510#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; 74515#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 74516#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 74517#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 74518#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 74519#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 74584#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 74583#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 74582#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 74580#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 74581#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 74588#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 74499#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 74573#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 74625#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); 74622#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 74623#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 74669#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); 74664#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 74665#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 74670#L24 assume ~n#1 < 2; 74667#merge_sortFINAL assume true; 74663#merge_sortEXIT >#87#return; 74657#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 74660#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 74666#L24 assume ~n#1 < 2; 74661#merge_sortFINAL assume true; 74656#merge_sortEXIT >#89#return; 74655#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 74654#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 74653#L12 assume !(merge_~j~0#1 == merge_~n#1); 74652#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 74649#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 74647#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 74645#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 74643#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 74641#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 74639#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 74637#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 74636#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 74635#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 74634#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 74633#L11-4 merge_~i~0#1 := 0; 74632#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 74631#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 74630#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 74629#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 74628#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 74627#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 74626#L8 assume { :end_inline_merge } true; 74624#merge_sortFINAL assume true; 74621#merge_sortEXIT >#87#return; 74531#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 74747#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 74746#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); 74530#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 74533#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 74745#L24 assume ~n#1 < 2; 74733#merge_sortFINAL assume true; 74736#merge_sortEXIT >#87#return; 74496#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 74744#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 74740#L24 assume ~n#1 < 2; 74741#merge_sortFINAL assume true; 75024#merge_sortEXIT >#89#return; 75022#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 75020#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 75018#L12 assume !(merge_~j~0#1 == merge_~n#1); 75016#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 75013#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 75010#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 75008#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 75006#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 75004#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 75002#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 74999#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 74998#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 74993#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 74994#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 74949#L11-4 merge_~i~0#1 := 0; 74950#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 74941#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 74942#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 74895#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 74896#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 74888#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 74889#L8 assume { :end_inline_merge } true; 74879#merge_sortFINAL assume true; 74880#merge_sortEXIT >#89#return; 74872#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 75943#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 74592#L12 assume !(merge_~j~0#1 == merge_~n#1); 74591#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 74590#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 74498#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 74500#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 74574#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 74569#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 74546#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 74547#L12 assume !(merge_~j~0#1 == merge_~n#1); 75883#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 74536#L14 [2022-12-13 17:46:30,852 INFO L750 eck$LassoCheckResult]: Loop: 74536#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 74538#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 75935#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 75933#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 75931#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 75929#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 75927#L12 assume !(merge_~j~0#1 == merge_~n#1); 75925#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 74536#L14 [2022-12-13 17:46:30,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:46:30,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1087724548, now seen corresponding path program 14 times [2022-12-13 17:46:30,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:46:30,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153530102] [2022-12-13 17:46:30,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:46:30,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:46:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:31,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 17:46:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:31,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:46:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:46:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:31,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-12-13 17:46:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:31,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:46:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:46:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:46:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 107 proven. 39 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-13 17:46:31,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:46:31,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153530102] [2022-12-13 17:46:31,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153530102] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:46:31,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467257102] [2022-12-13 17:46:31,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:46:31,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:46:31,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:46:31,216 INFO L229 MonitoredProcess]: Starting monitored process 218 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:46:31,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (218)] Waiting until timeout for monitored process [2022-12-13 17:46:31,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:46:31,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:46:31,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 17:46:31,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:46:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 60 proven. 37 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-12-13 17:46:31,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:46:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 61 proven. 44 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-12-13 17:46:31,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467257102] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:46:31,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:46:31,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 27 [2022-12-13 17:46:31,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582573634] [2022-12-13 17:46:31,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:46:31,864 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:46:31,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:46:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1719620237, now seen corresponding path program 5 times [2022-12-13 17:46:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:46:31,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773184706] [2022-12-13 17:46:31,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:46:31,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:46:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:46:31,868 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:46:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:46:31,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:46:32,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:46:32,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 17:46:32,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2022-12-13 17:46:32,058 INFO L87 Difference]: Start difference. First operand 1466 states and 1725 transitions. cyclomatic complexity: 320 Second operand has 27 states, 22 states have (on average 4.363636363636363) internal successors, (96), 21 states have internal predecessors, (96), 11 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 9 states have call predecessors, (14), 10 states have call successors, (14) [2022-12-13 17:46:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:46:32,904 INFO L93 Difference]: Finished difference Result 2518 states and 2958 transitions. [2022-12-13 17:46:32,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2518 states and 2958 transitions. [2022-12-13 17:46:32,914 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 293 [2022-12-13 17:46:32,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2518 states to 2422 states and 2844 transitions. [2022-12-13 17:46:32,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2126 [2022-12-13 17:46:32,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2126 [2022-12-13 17:46:32,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2422 states and 2844 transitions. [2022-12-13 17:46:32,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:46:32,925 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2422 states and 2844 transitions. [2022-12-13 17:46:32,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states and 2844 transitions. [2022-12-13 17:46:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 1408. [2022-12-13 17:46:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1344 states have (on average 1.1428571428571428) internal successors, (1536), 1332 states have internal predecessors, (1536), 42 states have call successors, (44), 23 states have call predecessors, (44), 22 states have return successors, (74), 52 states have call predecessors, (74), 39 states have call successors, (74) [2022-12-13 17:46:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1654 transitions. [2022-12-13 17:46:32,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1408 states and 1654 transitions. [2022-12-13 17:46:32,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 17:46:32,939 INFO L428 stractBuchiCegarLoop]: Abstraction has 1408 states and 1654 transitions. [2022-12-13 17:46:32,939 INFO L335 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2022-12-13 17:46:32,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1408 states and 1654 transitions. [2022-12-13 17:46:32,941 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 260 [2022-12-13 17:46:32,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:46:32,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:46:32,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 4, 4, 3, 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] [2022-12-13 17:46:32,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-12-13 17:46:32,942 INFO L748 eck$LassoCheckResult]: Stem: 79353#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 79301#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 79302#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; 79304#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 79305#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 79306#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 79307#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 79308#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 79361#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 79360#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 79359#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 79357#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 79358#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 79365#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 79366#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 79354#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 79290#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 79362#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 79363#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); 79321#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 79331#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 79332#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); 79296#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 79323#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 79389#L24 assume ~n#1 < 2; 79396#merge_sortFINAL assume true; 79390#merge_sortEXIT >#87#return; 79315#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 79435#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 79434#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); 79393#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 79395#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 79429#L24 assume ~n#1 < 2; 79428#merge_sortFINAL assume true; 79392#merge_sortEXIT >#87#return; 79343#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 79375#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 79342#L24 assume ~n#1 < 2; 79344#merge_sortFINAL assume true; 79754#merge_sortEXIT >#89#return; 79847#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 79846#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 79845#L12 assume !(merge_~j~0#1 == merge_~n#1); 79844#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 79841#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 79839#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 79837#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 79835#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 79833#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 79831#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 79829#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 79828#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 79827#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 79826#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 79825#L11-4 merge_~i~0#1 := 0; 79824#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 79823#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 79822#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 79821#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 79820#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 79819#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 79817#L8 assume { :end_inline_merge } true; 79818#merge_sortFINAL assume true; 79314#merge_sortEXIT >#89#return; 79317#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 80499#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 80498#L12 assume !(merge_~j~0#1 == merge_~n#1); 80497#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 80495#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 80494#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 80493#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 80492#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 80491#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 80490#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 80489#L12 assume !(merge_~j~0#1 == merge_~n#1); 80488#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 80486#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 80361#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 80360#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 80357#L12-2 [2022-12-13 17:46:32,942 INFO L750 eck$LassoCheckResult]: Loop: 80357#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 80359#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 80358#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 80356#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 80357#L12-2 [2022-12-13 17:46:32,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:46:32,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1927141374, now seen corresponding path program 15 times [2022-12-13 17:46:32,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:46:32,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621008025] [2022-12-13 17:46:32,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:46:32,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:46:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:46:32,982 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:46:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:46:33,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:46:33,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:46:33,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 7 times [2022-12-13 17:46:33,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:46:33,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62003608] [2022-12-13 17:46:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:46:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:46:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:46:33,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:46:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:46:33,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:46:33,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:46:33,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1610302695, now seen corresponding path program 16 times [2022-12-13 17:46:33,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:46:33,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876913719] [2022-12-13 17:46:33,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:46:33,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:46:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:46:33,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:46:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:46:33,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:46:59,336 WARN L233 SmtUtils]: Spent 7.78s on a formula simplification. DAG size of input: 239 DAG size of output: 229 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:47:03,483 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 17:47:03,483 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 17:47:03,483 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 17:47:03,483 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 17:47:03,483 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 17:47:03,483 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:03,483 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 17:47:03,483 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 17:47:03,483 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration32_Lasso [2022-12-13 17:47:03,483 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 17:47:03,483 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 17:47:03,488 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:03,490 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:03,491 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:03,493 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:03,494 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:03,495 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:03,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,217 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,218 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,219 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,220 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,221 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,222 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,223 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,224 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,225 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,225 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,226 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,227 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,228 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,229 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:10,230 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:47:11,501 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 17:47:11,501 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 17:47:11,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,502 INFO L229 MonitoredProcess]: Starting monitored process 219 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2022-12-13 17:47:11,504 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 [2022-12-13 17:47:11,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:47:11,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:47:11,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:47:11,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,518 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Forceful destruction successful, exit code 0 [2022-12-13 17:47:11,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,519 INFO L229 MonitoredProcess]: Starting monitored process 220 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2022-12-13 17:47:11,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 [2022-12-13 17:47:11,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:47:11,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:47:11,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Ended with exit code 0 [2022-12-13 17:47:11,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,537 INFO L229 MonitoredProcess]: Starting monitored process 221 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2022-12-13 17:47:11,539 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 [2022-12-13 17:47:11,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:47:11,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:47:11,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:47:11,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Ended with exit code 0 [2022-12-13 17:47:11,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,553 INFO L229 MonitoredProcess]: Starting monitored process 222 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2022-12-13 17:47:11,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 [2022-12-13 17:47:11,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:47:11,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:47:11,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:47:11,566 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Ended with exit code 0 [2022-12-13 17:47:11,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,569 INFO L229 MonitoredProcess]: Starting monitored process 223 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2022-12-13 17:47:11,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:47:11,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:47:11,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:47:11,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:47:11,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,585 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Ended with exit code 0 [2022-12-13 17:47:11,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,586 INFO L229 MonitoredProcess]: Starting monitored process 224 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2022-12-13 17:47:11,588 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 [2022-12-13 17:47:11,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:47:11,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:47:11,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:47:11,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Ended with exit code 0 [2022-12-13 17:47:11,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,603 INFO L229 MonitoredProcess]: Starting monitored process 225 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Waiting until timeout for monitored process [2022-12-13 17:47:11,605 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 [2022-12-13 17:47:11,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:47:11,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:47:11,647 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (225)] Ended with exit code 0 [2022-12-13 17:47:11,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,650 INFO L229 MonitoredProcess]: Starting monitored process 226 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Waiting until timeout for monitored process [2022-12-13 17:47:11,652 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 [2022-12-13 17:47:11,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:47:11,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:47:11,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:47:11,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (226)] Ended with exit code 0 [2022-12-13 17:47:11,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,668 INFO L229 MonitoredProcess]: Starting monitored process 227 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Waiting until timeout for monitored process [2022-12-13 17:47:11,669 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 [2022-12-13 17:47:11,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:47:11,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:47:11,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:47:11,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (227)] Ended with exit code 0 [2022-12-13 17:47:11,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,684 INFO L229 MonitoredProcess]: Starting monitored process 228 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Waiting until timeout for monitored process [2022-12-13 17:47:11,686 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 [2022-12-13 17:47:11,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:47:11,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:47:11,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (228)] Ended with exit code 0 [2022-12-13 17:47:11,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,705 INFO L229 MonitoredProcess]: Starting monitored process 229 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Waiting until timeout for monitored process [2022-12-13 17:47:11,707 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 [2022-12-13 17:47:11,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:47:11,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:47:11,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (229)] Ended with exit code 0 [2022-12-13 17:47:11,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,726 INFO L229 MonitoredProcess]: Starting monitored process 230 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Waiting until timeout for monitored process [2022-12-13 17:47:11,729 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 [2022-12-13 17:47:11,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:47:11,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:47:11,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:47:11,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (230)] Ended with exit code 0 [2022-12-13 17:47:11,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,743 INFO L229 MonitoredProcess]: Starting monitored process 231 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Waiting until timeout for monitored process [2022-12-13 17:47:11,745 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 [2022-12-13 17:47:11,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:47:11,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:47:11,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (231)] Ended with exit code 0 [2022-12-13 17:47:11,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,763 INFO L229 MonitoredProcess]: Starting monitored process 232 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Waiting until timeout for monitored process [2022-12-13 17:47:11,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:47:11,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:47:11,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:47:11,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:47:11,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (232)] Ended with exit code 0 [2022-12-13 17:47:11,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,780 INFO L229 MonitoredProcess]: Starting monitored process 233 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Waiting until timeout for monitored process [2022-12-13 17:47:11,782 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 [2022-12-13 17:47:11,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:47:11,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:47:11,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:47:11,794 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (233)] Ended with exit code 0 [2022-12-13 17:47:11,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,797 INFO L229 MonitoredProcess]: Starting monitored process 234 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Waiting until timeout for monitored process [2022-12-13 17:47:11,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:47:11,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:47:11,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:47:11,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,817 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (234)] Ended with exit code 0 [2022-12-13 17:47:11,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,818 INFO L229 MonitoredProcess]: Starting monitored process 235 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Waiting until timeout for monitored process [2022-12-13 17:47:11,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:47:11,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:47:11,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:47:11,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (235)] Ended with exit code 0 [2022-12-13 17:47:11,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,839 INFO L229 MonitoredProcess]: Starting monitored process 236 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Waiting until timeout for monitored process [2022-12-13 17:47:11,841 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 [2022-12-13 17:47:11,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:47:11,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:47:11,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:47:11,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (236)] Ended with exit code 0 [2022-12-13 17:47:11,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:11,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:11,866 INFO L229 MonitoredProcess]: Starting monitored process 237 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:11,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Waiting until timeout for monitored process [2022-12-13 17:47:11,868 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 [2022-12-13 17:47:11,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:47:11,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:47:11,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:47:11,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:47:11,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:47:11,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:47:11,927 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 17:47:12,067 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2022-12-13 17:47:12,067 INFO L444 ModelExtractionUtils]: 12 out of 70 variables were initially zero. Simplification set additionally 52 variables to zero. [2022-12-13 17:47:12,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:47:12,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:12,069 INFO L229 MonitoredProcess]: Starting monitored process 238 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:47:12,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Waiting until timeout for monitored process [2022-12-13 17:47:12,070 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 17:47:12,081 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-12-13 17:47:12,081 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 17:47:12,081 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n#1, merge_sort_merge_~k~0#1) = 9223372036854775806*merge_sort_#in~n#1 - 1*merge_sort_merge_~k~0#1 Supporting invariants [1*merge_sort_#in~a#1.offset - 1*v_rep(select #length merge_sort_merge_~x~0#1.base)_8 + 36893488147419103224*merge_sort_#in~n#1 >= 0] [2022-12-13 17:47:12,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (237)] Ended with exit code 0 [2022-12-13 17:47:12,406 INFO L156 tatePredicateManager]: 37 out of 39 supporting invariants were superfluous and have been removed [2022-12-13 17:47:12,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:47:12,476 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (238)] Ended with exit code 0 [2022-12-13 17:47:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:12,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 17:47:12,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:47:12,887 INFO L350 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 [2022-12-13 17:47:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:12,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:47:12,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:47:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:47:13,068 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 3 loop predicates [2022-12-13 17:47:13,068 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1408 states and 1654 transitions. cyclomatic complexity: 303 Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 17:47:13,271 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1408 states and 1654 transitions. cyclomatic complexity: 303. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Result 1408 states and 1654 transitions. Complement of second has 15 states. [2022-12-13 17:47:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 8 stem states 0 non-accepting loop states 1 accepting loop states [2022-12-13 17:47:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 17:47:13,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2022-12-13 17:47:13,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 79 letters. Loop has 4 letters. [2022-12-13 17:47:13,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:47:13,272 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:47:13,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:47:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:13,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 17:47:13,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:47:13,722 INFO L350 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 [2022-12-13 17:47:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:13,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:47:13,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:47:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:47:13,861 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 3 loop predicates [2022-12-13 17:47:13,861 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1408 states and 1654 transitions. cyclomatic complexity: 303 Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 17:47:14,101 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1408 states and 1654 transitions. cyclomatic complexity: 303. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Result 1408 states and 1654 transitions. Complement of second has 15 states. [2022-12-13 17:47:14,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 8 stem states 0 non-accepting loop states 1 accepting loop states [2022-12-13 17:47:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 17:47:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2022-12-13 17:47:14,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 79 letters. Loop has 4 letters. [2022-12-13 17:47:14,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:47:14,102 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:47:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:47:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:14,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-13 17:47:14,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:47:14,593 INFO L350 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 [2022-12-13 17:47:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:14,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:47:14,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:47:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:47:14,738 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 3 loop predicates [2022-12-13 17:47:14,738 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1408 states and 1654 transitions. cyclomatic complexity: 303 Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 17:47:15,077 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1408 states and 1654 transitions. cyclomatic complexity: 303. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Result 1724 states and 2043 transitions. Complement of second has 35 states. [2022-12-13 17:47:15,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 10 stem states 2 non-accepting loop states 2 accepting loop states [2022-12-13 17:47:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-12-13 17:47:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 111 transitions. [2022-12-13 17:47:15,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 79 letters. Loop has 4 letters. [2022-12-13 17:47:15,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:47:15,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 83 letters. Loop has 4 letters. [2022-12-13 17:47:15,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:47:15,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 111 transitions. Stem has 79 letters. Loop has 8 letters. [2022-12-13 17:47:15,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:47:15,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1724 states and 2043 transitions. [2022-12-13 17:47:15,084 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 169 [2022-12-13 17:47:15,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1724 states to 1324 states and 1541 transitions. [2022-12-13 17:47:15,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 898 [2022-12-13 17:47:15,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1026 [2022-12-13 17:47:15,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1324 states and 1541 transitions. [2022-12-13 17:47:15,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:47:15,088 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1324 states and 1541 transitions. [2022-12-13 17:47:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states and 1541 transitions. [2022-12-13 17:47:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1173. [2022-12-13 17:47:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1112 states have (on average 1.1402877697841727) internal successors, (1268), 1099 states have internal predecessors, (1268), 42 states have call successors, (44), 23 states have call predecessors, (44), 19 states have return successors, (70), 50 states have call predecessors, (70), 36 states have call successors, (70) [2022-12-13 17:47:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1382 transitions. [2022-12-13 17:47:15,097 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1173 states and 1382 transitions. [2022-12-13 17:47:15,097 INFO L428 stractBuchiCegarLoop]: Abstraction has 1173 states and 1382 transitions. [2022-12-13 17:47:15,097 INFO L335 stractBuchiCegarLoop]: ======== Iteration 33 ============ [2022-12-13 17:47:15,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1173 states and 1382 transitions. [2022-12-13 17:47:15,099 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 161 [2022-12-13 17:47:15,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:47:15,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:47:15,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:47:15,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 17:47:15,100 INFO L748 eck$LassoCheckResult]: Stem: 86369#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 86316#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 86317#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; 86319#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 86320#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 86321#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 86322#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 86323#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 86381#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 86380#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 86379#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 86377#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 86378#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 86385#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 86375#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 86376#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 86374#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 86372#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 86373#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 86382#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86383#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); 86307#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 86336#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86344#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); 86359#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 86422#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86575#L24 assume ~n#1 < 2; 86574#merge_sortFINAL assume true; 86570#merge_sortEXIT >#87#return; 86353#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 86400#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86387#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); 86388#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 86673#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86676#L24 assume ~n#1 < 2; 86671#merge_sortFINAL assume true; 86672#merge_sortEXIT >#87#return; 86342#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 86341#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86343#L24 assume ~n#1 < 2; 86356#merge_sortFINAL assume true; 86712#merge_sortEXIT >#89#return; 86711#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 86710#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 86709#L12 assume !(merge_~j~0#1 == merge_~n#1); 86708#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 86705#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 86703#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 86701#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 86699#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 86697#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 86695#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 86693#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 86688#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 86670#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 86669#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 86668#L11-4 merge_~i~0#1 := 0; 86667#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 86666#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 86665#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 86664#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 86663#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 86662#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 86661#L8 assume { :end_inline_merge } true; 86660#merge_sortFINAL assume true; 86658#merge_sortEXIT >#89#return; 86657#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 86656#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 86654#L12 assume !(merge_~j~0#1 == merge_~n#1); 86652#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 86649#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 86650#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 86719#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 86718#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 86717#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 86715#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 86686#L12 assume !(merge_~j~0#1 == merge_~n#1); 86687#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 86583#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 86584#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 86547#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 86548#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 86461#L11-4 merge_~i~0#1 := 0; 86462#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 86453#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 86454#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 86447#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 86448#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 86437#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 86438#L8 assume { :end_inline_merge } true; 86424#merge_sortFINAL assume true; 86425#merge_sortEXIT >#87#return; 86303#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 86412#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86528#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); 86409#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 86408#$Ultimate##0 [2022-12-13 17:47:15,100 INFO L750 eck$LassoCheckResult]: Loop: 86408#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 86411#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); 86410#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 86408#$Ultimate##0 [2022-12-13 17:47:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:47:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1088096615, now seen corresponding path program 5 times [2022-12-13 17:47:15,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:47:15,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782047149] [2022-12-13 17:47:15,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:47:15,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:47:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:15,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:47:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:15,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:47:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:15,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:47:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:15,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:47:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:15,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:47:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 75 proven. 81 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-13 17:47:15,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:47:15,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782047149] [2022-12-13 17:47:15,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782047149] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:47:15,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069088296] [2022-12-13 17:47:15,632 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 17:47:15,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:47:15,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:15,633 INFO L229 MonitoredProcess]: Starting monitored process 239 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:47:15,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (239)] Waiting until timeout for monitored process [2022-12-13 17:47:16,152 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-12-13 17:47:16,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:47:16,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 17:47:16,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:47:16,361 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 54 proven. 43 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-13 17:47:16,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:47:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 59 proven. 38 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-12-13 17:47:16,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069088296] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:47:16,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:47:16,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 12, 12] total 40 [2022-12-13 17:47:16,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948520410] [2022-12-13 17:47:16,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:47:16,629 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:47:16,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:47:16,629 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 6 times [2022-12-13 17:47:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:47:16,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038732984] [2022-12-13 17:47:16,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:47:16,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:47:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:47:16,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:47:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:47:16,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:47:16,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:47:16,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 17:47:16,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1408, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 17:47:16,707 INFO L87 Difference]: Start difference. First operand 1173 states and 1382 transitions. cyclomatic complexity: 257 Second operand has 40 states, 38 states have (on average 3.6315789473684212) internal successors, (138), 35 states have internal predecessors, (138), 8 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) [2022-12-13 17:47:19,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:47:19,396 INFO L93 Difference]: Finished difference Result 4719 states and 5400 transitions. [2022-12-13 17:47:19,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4719 states and 5400 transitions. [2022-12-13 17:47:19,408 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 360 [2022-12-13 17:47:19,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4719 states to 4719 states and 5400 transitions. [2022-12-13 17:47:19,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3025 [2022-12-13 17:47:19,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3025 [2022-12-13 17:47:19,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4719 states and 5400 transitions. [2022-12-13 17:47:19,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:47:19,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4719 states and 5400 transitions. [2022-12-13 17:47:19,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states and 5400 transitions. [2022-12-13 17:47:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 2025. [2022-12-13 17:47:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2025 states, 1964 states have (on average 1.124236252545825) internal successors, (2208), 1947 states have internal predecessors, (2208), 42 states have call successors, (44), 23 states have call predecessors, (44), 19 states have return successors, (70), 54 states have call predecessors, (70), 36 states have call successors, (70) [2022-12-13 17:47:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2322 transitions. [2022-12-13 17:47:19,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2025 states and 2322 transitions. [2022-12-13 17:47:19,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-12-13 17:47:19,450 INFO L428 stractBuchiCegarLoop]: Abstraction has 2025 states and 2322 transitions. [2022-12-13 17:47:19,450 INFO L335 stractBuchiCegarLoop]: ======== Iteration 34 ============ [2022-12-13 17:47:19,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2025 states and 2322 transitions. [2022-12-13 17:47:19,454 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 161 [2022-12-13 17:47:19,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:47:19,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:47:19,455 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-13 17:47:19,455 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 17:47:19,455 INFO L748 eck$LassoCheckResult]: Stem: 93096#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 93045#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 93046#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; 93048#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 93049#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 93050#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 93051#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 93052#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 93103#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 93102#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 93101#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 93099#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 93100#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 93105#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 93106#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 93180#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 93098#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 93097#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 93087#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 93104#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 93086#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); 93035#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 93068#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 93075#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); 93111#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 93109#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 93113#L24 assume ~n#1 < 2; 93135#merge_sortFINAL assume true; 93128#merge_sortEXIT >#87#return; 93116#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 93187#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 93184#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); 93132#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 93134#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 93185#L24 assume ~n#1 < 2; 93137#merge_sortFINAL assume true; 93131#merge_sortEXIT >#87#return; 93084#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 93108#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 93083#L24 assume ~n#1 < 2; 93085#merge_sortFINAL assume true; 93329#merge_sortEXIT >#89#return; 93328#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 93327#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 93326#L12 assume !(merge_~j~0#1 == merge_~n#1); 93325#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 93322#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 93320#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 93318#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 93316#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 93314#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 93312#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 93310#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 93309#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 93308#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 93307#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 93306#L11-4 merge_~i~0#1 := 0; 93305#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 93304#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 93303#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 93302#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 93301#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 93300#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 93299#L8 assume { :end_inline_merge } true; 93298#merge_sortFINAL assume true; 93296#merge_sortEXIT >#89#return; 93295#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 93294#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 93293#L12 assume !(merge_~j~0#1 == merge_~n#1); 93292#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 93290#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 93291#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 93289#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 93287#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 93285#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 93283#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 93281#L12 assume !(merge_~j~0#1 == merge_~n#1); 93279#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 93276#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 93277#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 94628#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 94629#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 94624#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 94625#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 94619#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 93630#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 93631#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 94623#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 93262#L11-4 merge_~i~0#1 := 0; 93261#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 93260#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 93259#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 93258#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 93257#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 93256#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 93224#L8 assume { :end_inline_merge } true; 93223#merge_sortFINAL assume true; 93167#merge_sortEXIT >#87#return; 93032#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 93165#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 93160#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); 93124#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 93125#$Ultimate##0 [2022-12-13 17:47:19,455 INFO L750 eck$LassoCheckResult]: Loop: 93125#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 93163#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); 93151#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 93125#$Ultimate##0 [2022-12-13 17:47:19,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:47:19,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1620816540, now seen corresponding path program 17 times [2022-12-13 17:47:19,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:47:19,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503272101] [2022-12-13 17:47:19,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:47:19,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:47:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:19,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:47:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:19,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:47:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:19,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:47:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:19,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:47:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:47:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:47:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 55 proven. 68 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-13 17:47:19,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:47:19,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503272101] [2022-12-13 17:47:19,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503272101] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:47:19,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069734385] [2022-12-13 17:47:19,870 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 17:47:19,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:47:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:47:19,871 INFO L229 MonitoredProcess]: Starting monitored process 240 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:47:19,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (240)] Waiting until timeout for monitored process [2022-12-13 17:47:20,494 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-12-13 17:47:20,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:47:20,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 17:47:20,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:47:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 89 proven. 13 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-12-13 17:47:20,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:47:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 89 proven. 13 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-12-13 17:47:20,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069734385] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:47:20,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:47:20,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 22 [2022-12-13 17:47:20,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113877169] [2022-12-13 17:47:20,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:47:20,678 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:47:20,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:47:20,678 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 7 times [2022-12-13 17:47:20,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:47:20,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304639521] [2022-12-13 17:47:20,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:47:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:47:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:47:20,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:47:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:47:20,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:47:20,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:47:20,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 17:47:20,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2022-12-13 17:47:20,776 INFO L87 Difference]: Start difference. First operand 2025 states and 2322 transitions. cyclomatic complexity: 345 Second operand has 22 states, 21 states have (on average 5.238095238095238) internal successors, (110), 20 states have internal predecessors, (110), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 17:47:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:47:21,749 INFO L93 Difference]: Finished difference Result 2939 states and 3392 transitions. [2022-12-13 17:47:21,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2939 states and 3392 transitions. [2022-12-13 17:47:21,756 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 251 [2022-12-13 17:47:21,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2939 states to 2939 states and 3392 transitions. [2022-12-13 17:47:21,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1839 [2022-12-13 17:47:21,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1839 [2022-12-13 17:47:21,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2939 states and 3392 transitions. [2022-12-13 17:47:21,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:47:21,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2939 states and 3392 transitions. [2022-12-13 17:47:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states and 3392 transitions. [2022-12-13 17:47:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2037. [2022-12-13 17:47:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 1976 states have (on average 1.1234817813765183) internal successors, (2220), 1959 states have internal predecessors, (2220), 42 states have call successors, (44), 23 states have call predecessors, (44), 19 states have return successors, (70), 54 states have call predecessors, (70), 36 states have call successors, (70) [2022-12-13 17:47:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2334 transitions. [2022-12-13 17:47:21,779 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2037 states and 2334 transitions. [2022-12-13 17:47:21,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 17:47:21,780 INFO L428 stractBuchiCegarLoop]: Abstraction has 2037 states and 2334 transitions. [2022-12-13 17:47:21,780 INFO L335 stractBuchiCegarLoop]: ======== Iteration 35 ============ [2022-12-13 17:47:21,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2037 states and 2334 transitions. [2022-12-13 17:47:21,784 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 161 [2022-12-13 17:47:21,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:47:21,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:47:21,785 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-13 17:47:21,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 17:47:21,785 INFO L748 eck$LassoCheckResult]: Stem: 98888#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 98834#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 98835#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; 98839#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 98840#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 98841#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 98842#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 98843#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 98897#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 98896#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 98895#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 98893#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 98894#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 98902#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 98903#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 98890#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 98891#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 98892#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 98900#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 98901#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 98908#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); 98828#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 98866#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 98867#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); 98858#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 98859#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 98906#L24 assume ~n#1 < 2; 99052#merge_sortFINAL assume true; 99049#merge_sortEXIT >#87#return; 98911#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 99047#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 99104#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); 99087#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 99095#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 99099#L24 assume ~n#1 < 2; 99094#merge_sortFINAL assume true; 99086#merge_sortEXIT >#87#return; 98878#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 98905#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 98877#L24 assume ~n#1 < 2; 98879#merge_sortFINAL assume true; 99207#merge_sortEXIT >#89#return; 99206#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 99205#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 99204#L12 assume !(merge_~j~0#1 == merge_~n#1); 99203#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 99200#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 99198#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 99196#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 99194#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 99192#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 99190#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 99188#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 99187#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 99186#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 99185#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 99184#L11-4 merge_~i~0#1 := 0; 99183#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 99182#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 99181#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 99180#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 99179#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 99178#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 99177#L8 assume { :end_inline_merge } true; 99176#merge_sortFINAL assume true; 99174#merge_sortEXIT >#89#return; 99173#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 99172#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 99171#L12 assume !(merge_~j~0#1 == merge_~n#1); 99170#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 99168#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 99169#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 99167#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 99165#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 99163#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 99161#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 99159#L12 assume !(merge_~j~0#1 == merge_~n#1); 99157#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 99154#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 99155#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 100042#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 100030#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 100010#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 99736#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 99733#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 99734#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 99928#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 99735#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 99139#L11-4 merge_~i~0#1 := 0; 99138#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 99137#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 99136#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 99135#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 99134#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 98937#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 98936#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 98933#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 98931#L8 assume { :end_inline_merge } true; 98929#merge_sortFINAL assume true; 98921#merge_sortEXIT >#87#return; 98824#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 98918#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 98912#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); 98913#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 98914#$Ultimate##0 [2022-12-13 17:47:21,785 INFO L750 eck$LassoCheckResult]: Loop: 98914#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 98917#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); 98915#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 98914#$Ultimate##0 [2022-12-13 17:47:21,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:47:21,785 INFO L85 PathProgramCache]: Analyzing trace with hash -735385190, now seen corresponding path program 18 times [2022-12-13 17:47:21,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:47:21,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758941971] [2022-12-13 17:47:21,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:47:21,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:47:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:47:21,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:47:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:47:21,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:47:21,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:47:21,885 INFO L85 PathProgramCache]: Analyzing trace with hash 30001, now seen corresponding path program 8 times [2022-12-13 17:47:21,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:47:21,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738845442] [2022-12-13 17:47:21,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:47:21,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:47:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:47:21,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:47:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:47:21,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:47:21,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:47:21,891 INFO L85 PathProgramCache]: Analyzing trace with hash 767981816, now seen corresponding path program 19 times [2022-12-13 17:47:21,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:47:21,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433453878] [2022-12-13 17:47:21,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:47:21,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:47:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:47:21,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:47:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:47:21,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:47:55,200 WARN L233 SmtUtils]: Spent 27.98s on a formula simplification. DAG size of input: 414 DAG size of output: 348 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:48:08,201 WARN L233 SmtUtils]: Spent 10.88s on a formula simplification. DAG size of input: 185 DAG size of output: 174 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:48:14,441 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 192 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:48:23,952 WARN L233 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 186 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:48:41,817 WARN L233 SmtUtils]: Spent 17.78s on a formula simplification. DAG size of input: 219 DAG size of output: 216 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:49:02,768 WARN L233 SmtUtils]: Spent 12.51s on a formula simplification. DAG size of input: 186 DAG size of output: 184 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:49:14,781 WARN L233 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 168 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:49:22,504 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 174 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:49:35,318 WARN L233 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 168 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:49:46,971 WARN L233 SmtUtils]: Spent 11.65s on a formula simplification. DAG size of input: 224 DAG size of output: 213 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:50:32,115 WARN L233 SmtUtils]: Spent 23.99s on a formula simplification that was a NOOP. DAG size: 307 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:50:32,129 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 17:50:32,129 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 17:50:32,129 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 17:50:32,129 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 17:50:32,129 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 17:50:32,129 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:50:32,129 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 17:50:32,129 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 17:50:32,129 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration35_Lasso [2022-12-13 17:50:32,129 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 17:50:32,129 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 17:50:32,134 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,138 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,139 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,140 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,141 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,142 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,142 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,143 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,144 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,145 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,146 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,147 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,147 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,148 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,149 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,150 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,150 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,151 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,152 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,153 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,153 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,154 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,155 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,156 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,156 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,157 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,158 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,159 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,159 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,160 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,161 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,162 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,162 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,163 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,164 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,165 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,165 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,166 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,167 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,168 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,168 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:50:32,169 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:51:09,490 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:51:09,491 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:51:09,492 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:51:09,493 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:51:09,495 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:51:09,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:51:12,525 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 17:51:12,525 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 17:51:12,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,527 INFO L229 MonitoredProcess]: Starting monitored process 241 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Waiting until timeout for monitored process [2022-12-13 17:51:12,529 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 [2022-12-13 17:51:12,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:51:12,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:51:12,543 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (241)] Forceful destruction successful, exit code 0 [2022-12-13 17:51:12,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,547 INFO L229 MonitoredProcess]: Starting monitored process 242 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Waiting until timeout for monitored process [2022-12-13 17:51:12,549 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 [2022-12-13 17:51:12,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (242)] Ended with exit code 0 [2022-12-13 17:51:12,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,564 INFO L229 MonitoredProcess]: Starting monitored process 243 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Waiting until timeout for monitored process [2022-12-13 17:51:12,566 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 [2022-12-13 17:51:12,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (243)] Ended with exit code 0 [2022-12-13 17:51:12,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,580 INFO L229 MonitoredProcess]: Starting monitored process 244 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Waiting until timeout for monitored process [2022-12-13 17:51:12,582 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 [2022-12-13 17:51:12,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (244)] Forceful destruction successful, exit code 0 [2022-12-13 17:51:12,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,597 INFO L229 MonitoredProcess]: Starting monitored process 245 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Waiting until timeout for monitored process [2022-12-13 17:51:12,599 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 [2022-12-13 17:51:12,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (245)] Ended with exit code 0 [2022-12-13 17:51:12,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,614 INFO L229 MonitoredProcess]: Starting monitored process 246 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Waiting until timeout for monitored process [2022-12-13 17:51:12,616 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 [2022-12-13 17:51:12,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (246)] Ended with exit code 0 [2022-12-13 17:51:12,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,631 INFO L229 MonitoredProcess]: Starting monitored process 247 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Waiting until timeout for monitored process [2022-12-13 17:51:12,633 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 [2022-12-13 17:51:12,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (247)] Forceful destruction successful, exit code 0 [2022-12-13 17:51:12,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,648 INFO L229 MonitoredProcess]: Starting monitored process 248 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Waiting until timeout for monitored process [2022-12-13 17:51:12,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 [2022-12-13 17:51:12,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:51:12,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:51:12,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (248)] Ended with exit code 0 [2022-12-13 17:51:12,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,667 INFO L229 MonitoredProcess]: Starting monitored process 249 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Waiting until timeout for monitored process [2022-12-13 17:51:12,669 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 [2022-12-13 17:51:12,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (249)] Ended with exit code 0 [2022-12-13 17:51:12,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,684 INFO L229 MonitoredProcess]: Starting monitored process 250 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Waiting until timeout for monitored process [2022-12-13 17:51:12,686 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 [2022-12-13 17:51:12,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (250)] Ended with exit code 0 [2022-12-13 17:51:12,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,700 INFO L229 MonitoredProcess]: Starting monitored process 251 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Waiting until timeout for monitored process [2022-12-13 17:51:12,702 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 [2022-12-13 17:51:12,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,712 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,712 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,712 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (251)] Ended with exit code 0 [2022-12-13 17:51:12,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,717 INFO L229 MonitoredProcess]: Starting monitored process 252 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Waiting until timeout for monitored process [2022-12-13 17:51:12,718 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 [2022-12-13 17:51:12,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,730 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (252)] Ended with exit code 0 [2022-12-13 17:51:12,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,733 INFO L229 MonitoredProcess]: Starting monitored process 253 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Waiting until timeout for monitored process [2022-12-13 17:51:12,735 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 [2022-12-13 17:51:12,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,745 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,745 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,746 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,748 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (253)] Ended with exit code 0 [2022-12-13 17:51:12,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,749 INFO L229 MonitoredProcess]: Starting monitored process 254 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Waiting until timeout for monitored process [2022-12-13 17:51:12,751 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 [2022-12-13 17:51:12,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (254)] Ended with exit code 0 [2022-12-13 17:51:12,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,766 INFO L229 MonitoredProcess]: Starting monitored process 255 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Waiting until timeout for monitored process [2022-12-13 17:51:12,768 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 [2022-12-13 17:51:12,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (255)] Ended with exit code 0 [2022-12-13 17:51:12,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,783 INFO L229 MonitoredProcess]: Starting monitored process 256 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Waiting until timeout for monitored process [2022-12-13 17:51:12,785 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 [2022-12-13 17:51:12,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,794 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,798 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (256)] Ended with exit code 0 [2022-12-13 17:51:12,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,799 INFO L229 MonitoredProcess]: Starting monitored process 257 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Waiting until timeout for monitored process [2022-12-13 17:51:12,801 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 [2022-12-13 17:51:12,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,811 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (257)] Ended with exit code 0 [2022-12-13 17:51:12,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,816 INFO L229 MonitoredProcess]: Starting monitored process 258 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Waiting until timeout for monitored process [2022-12-13 17:51:12,818 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 [2022-12-13 17:51:12,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,832 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (258)] Ended with exit code 0 [2022-12-13 17:51:12,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,833 INFO L229 MonitoredProcess]: Starting monitored process 259 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Waiting until timeout for monitored process [2022-12-13 17:51:12,835 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 [2022-12-13 17:51:12,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,848 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (259)] Ended with exit code 0 [2022-12-13 17:51:12,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,849 INFO L229 MonitoredProcess]: Starting monitored process 260 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Waiting until timeout for monitored process [2022-12-13 17:51:12,851 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 [2022-12-13 17:51:12,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (260)] Ended with exit code 0 [2022-12-13 17:51:12,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,866 INFO L229 MonitoredProcess]: Starting monitored process 261 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Waiting until timeout for monitored process [2022-12-13 17:51:12,868 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 [2022-12-13 17:51:12,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (261)] Ended with exit code 0 [2022-12-13 17:51:12,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,883 INFO L229 MonitoredProcess]: Starting monitored process 262 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Waiting until timeout for monitored process [2022-12-13 17:51:12,885 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 [2022-12-13 17:51:12,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (262)] Ended with exit code 0 [2022-12-13 17:51:12,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,900 INFO L229 MonitoredProcess]: Starting monitored process 263 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Waiting until timeout for monitored process [2022-12-13 17:51:12,902 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 [2022-12-13 17:51:12,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,915 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (263)] Ended with exit code 0 [2022-12-13 17:51:12,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,917 INFO L229 MonitoredProcess]: Starting monitored process 264 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Waiting until timeout for monitored process [2022-12-13 17:51:12,919 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 [2022-12-13 17:51:12,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (264)] Ended with exit code 0 [2022-12-13 17:51:12,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,933 INFO L229 MonitoredProcess]: Starting monitored process 265 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Waiting until timeout for monitored process [2022-12-13 17:51:12,935 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 [2022-12-13 17:51:12,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (265)] Ended with exit code 0 [2022-12-13 17:51:12,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,950 INFO L229 MonitoredProcess]: Starting monitored process 266 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Waiting until timeout for monitored process [2022-12-13 17:51:12,952 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 [2022-12-13 17:51:12,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,962 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,962 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (266)] Ended with exit code 0 [2022-12-13 17:51:12,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,967 INFO L229 MonitoredProcess]: Starting monitored process 267 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Waiting until timeout for monitored process [2022-12-13 17:51:12,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:51:12,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,981 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:12,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (267)] Ended with exit code 0 [2022-12-13 17:51:12,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:12,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:12,985 INFO L229 MonitoredProcess]: Starting monitored process 268 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:12,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Waiting until timeout for monitored process [2022-12-13 17:51:12,987 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 [2022-12-13 17:51:12,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:12,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:12,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:12,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:12,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:12,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:12,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:12,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (268)] Forceful destruction successful, exit code 0 [2022-12-13 17:51:13,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,002 INFO L229 MonitoredProcess]: Starting monitored process 269 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Waiting until timeout for monitored process [2022-12-13 17:51:13,004 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 [2022-12-13 17:51:13,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:13,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:13,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:13,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (269)] Ended with exit code 0 [2022-12-13 17:51:13,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,019 INFO L229 MonitoredProcess]: Starting monitored process 270 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Waiting until timeout for monitored process [2022-12-13 17:51:13,021 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 [2022-12-13 17:51:13,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:13,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:13,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:13,032 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (270)] Forceful destruction successful, exit code 0 [2022-12-13 17:51:13,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,035 INFO L229 MonitoredProcess]: Starting monitored process 271 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Waiting until timeout for monitored process [2022-12-13 17:51:13,037 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 [2022-12-13 17:51:13,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:13,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:13,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:13,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (271)] Ended with exit code 0 [2022-12-13 17:51:13,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,052 INFO L229 MonitoredProcess]: Starting monitored process 272 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Waiting until timeout for monitored process [2022-12-13 17:51:13,053 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 [2022-12-13 17:51:13,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:13,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:13,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:13,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (272)] Ended with exit code 0 [2022-12-13 17:51:13,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,068 INFO L229 MonitoredProcess]: Starting monitored process 273 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Waiting until timeout for monitored process [2022-12-13 17:51:13,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 [2022-12-13 17:51:13,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:13,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:13,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:13,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (273)] Ended with exit code 0 [2022-12-13 17:51:13,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,085 INFO L229 MonitoredProcess]: Starting monitored process 274 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Waiting until timeout for monitored process [2022-12-13 17:51:13,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 [2022-12-13 17:51:13,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:13,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:13,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:13,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,101 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (274)] Ended with exit code 0 [2022-12-13 17:51:13,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,102 INFO L229 MonitoredProcess]: Starting monitored process 275 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Waiting until timeout for monitored process [2022-12-13 17:51:13,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 [2022-12-13 17:51:13,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:13,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:13,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:13,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (275)] Ended with exit code 0 [2022-12-13 17:51:13,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,118 INFO L229 MonitoredProcess]: Starting monitored process 276 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Waiting until timeout for monitored process [2022-12-13 17:51:13,120 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 [2022-12-13 17:51:13,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:13,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:13,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:13,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (276)] Forceful destruction successful, exit code 0 [2022-12-13 17:51:13,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,135 INFO L229 MonitoredProcess]: Starting monitored process 277 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Waiting until timeout for monitored process [2022-12-13 17:51:13,137 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 [2022-12-13 17:51:13,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:13,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:13,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:13,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (277)] Ended with exit code 0 [2022-12-13 17:51:13,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,152 INFO L229 MonitoredProcess]: Starting monitored process 278 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Waiting until timeout for monitored process [2022-12-13 17:51:13,154 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 [2022-12-13 17:51:13,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:13,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:13,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:13,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (278)] Ended with exit code 0 [2022-12-13 17:51:13,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,168 INFO L229 MonitoredProcess]: Starting monitored process 279 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Waiting until timeout for monitored process [2022-12-13 17:51:13,170 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 [2022-12-13 17:51:13,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:13,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:13,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:13,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (279)] Ended with exit code 0 [2022-12-13 17:51:13,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,185 INFO L229 MonitoredProcess]: Starting monitored process 280 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Waiting until timeout for monitored process [2022-12-13 17:51:13,187 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 [2022-12-13 17:51:13,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:13,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,197 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:13,197 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:13,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (280)] Ended with exit code 0 [2022-12-13 17:51:13,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,202 INFO L229 MonitoredProcess]: Starting monitored process 281 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Waiting until timeout for monitored process [2022-12-13 17:51:13,204 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 [2022-12-13 17:51:13,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:51:13,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:51:13,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:51:13,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (281)] Ended with exit code 0 [2022-12-13 17:51:13,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,218 INFO L229 MonitoredProcess]: Starting monitored process 282 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Waiting until timeout for monitored process [2022-12-13 17:51:13,221 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 [2022-12-13 17:51:13,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:51:13,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:51:13,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (282)] Forceful destruction successful, exit code 0 [2022-12-13 17:51:13,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,239 INFO L229 MonitoredProcess]: Starting monitored process 283 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Waiting until timeout for monitored process [2022-12-13 17:51:13,241 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 [2022-12-13 17:51:13,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:51:13,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:51:13,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:51:13,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (283)] Ended with exit code 0 [2022-12-13 17:51:13,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,259 INFO L229 MonitoredProcess]: Starting monitored process 284 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Waiting until timeout for monitored process [2022-12-13 17:51:13,261 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 [2022-12-13 17:51:13,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:51:13,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:51:13,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:51:13,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:51:13,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:51:13,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:51:13,291 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 17:51:13,336 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-12-13 17:51:13,336 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-12-13 17:51:13,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:51:13,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:13,337 INFO L229 MonitoredProcess]: Starting monitored process 285 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:51:13,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Waiting until timeout for monitored process [2022-12-13 17:51:13,339 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 17:51:13,350 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 17:51:13,350 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 17:51:13,350 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(merge_sort_#in~n#1) = 1*merge_sort_#in~n#1 Supporting invariants [] [2022-12-13 17:51:13,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (284)] Ended with exit code 0 [2022-12-13 17:51:13,360 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2022-12-13 17:51:13,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:51:13,428 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (285)] Ended with exit code 0 [2022-12-13 17:51:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:13,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 17:51:13,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:51:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:13,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 17:51:13,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:51:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:51:13,813 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-12-13 17:51:13,814 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2037 states and 2334 transitions. cyclomatic complexity: 345 Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:51:13,858 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2037 states and 2334 transitions. cyclomatic complexity: 345. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 2048 states and 2346 transitions. Complement of second has 13 states. [2022-12-13 17:51:13,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-12-13 17:51:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:51:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-12-13 17:51:13,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 104 letters. Loop has 3 letters. [2022-12-13 17:51:13,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:51:13,859 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:51:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:51:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:13,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 17:51:13,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:51:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:14,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 17:51:14,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:51:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:51:14,346 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2022-12-13 17:51:14,346 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2037 states and 2334 transitions. cyclomatic complexity: 345 Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:51:14,386 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2037 states and 2334 transitions. cyclomatic complexity: 345. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 2048 states and 2346 transitions. Complement of second has 13 states. [2022-12-13 17:51:14,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-12-13 17:51:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:51:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-12-13 17:51:14,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 104 letters. Loop has 3 letters. [2022-12-13 17:51:14,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:51:14,387 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:51:14,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:51:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:14,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 17:51:14,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:51:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:14,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 17:51:14,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:51:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:51:14,878 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 3 loop predicates [2022-12-13 17:51:14,878 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2037 states and 2334 transitions. cyclomatic complexity: 345 Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:51:14,942 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2037 states and 2334 transitions. cyclomatic complexity: 345. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 2083 states and 2389 transitions. Complement of second has 16 states. [2022-12-13 17:51:14,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-12-13 17:51:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 17:51:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 17:51:14,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 104 letters. Loop has 3 letters. [2022-12-13 17:51:14,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:51:14,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 107 letters. Loop has 3 letters. [2022-12-13 17:51:14,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:51:14,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 104 letters. Loop has 6 letters. [2022-12-13 17:51:14,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:51:14,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2083 states and 2389 transitions. [2022-12-13 17:51:14,955 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 165 [2022-12-13 17:51:14,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2083 states to 2054 states and 2357 transitions. [2022-12-13 17:51:14,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1338 [2022-12-13 17:51:14,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1347 [2022-12-13 17:51:14,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2054 states and 2357 transitions. [2022-12-13 17:51:14,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:51:14,963 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2054 states and 2357 transitions. [2022-12-13 17:51:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states and 2357 transitions. [2022-12-13 17:51:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2050. [2022-12-13 17:51:14,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 1985 states have (on average 1.1234256926952142) internal successors, (2230), 1969 states have internal predecessors, (2230), 43 states have call successors, (45), 26 states have call predecessors, (45), 22 states have return successors, (74), 54 states have call predecessors, (74), 37 states have call successors, (74) [2022-12-13 17:51:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2349 transitions. [2022-12-13 17:51:14,984 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2050 states and 2349 transitions. [2022-12-13 17:51:14,984 INFO L428 stractBuchiCegarLoop]: Abstraction has 2050 states and 2349 transitions. [2022-12-13 17:51:14,984 INFO L335 stractBuchiCegarLoop]: ======== Iteration 36 ============ [2022-12-13 17:51:14,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 2349 transitions. [2022-12-13 17:51:14,988 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 163 [2022-12-13 17:51:14,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:51:14,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:51:14,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-13 17:51:14,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2] [2022-12-13 17:51:14,989 INFO L748 eck$LassoCheckResult]: Stem: 108157#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 108098#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 108099#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; 108101#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 108102#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 108103#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 108104#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 108105#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 108166#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 108165#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 108164#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 108162#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 108163#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 108170#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 108171#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 108159#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 108160#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 108161#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 108145#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 108167#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108144#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); 108092#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 108122#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108130#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); 108185#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 108310#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108314#L24 assume ~n#1 < 2; 108311#merge_sortFINAL assume true; 108307#merge_sortEXIT >#87#return; 108261#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 108264#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108305#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); 108301#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 108302#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108306#L24 assume ~n#1 < 2; 108304#merge_sortFINAL assume true; 108300#merge_sortEXIT >#87#return; 108297#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 108298#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108303#L24 assume ~n#1 < 2; 108299#merge_sortFINAL assume true; 108296#merge_sortEXIT >#89#return; 108295#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 108294#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 108293#L12 assume !(merge_~j~0#1 == merge_~n#1); 108292#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 108289#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 108287#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 108285#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 108283#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 108281#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 108279#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 108277#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 108276#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 108275#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 108274#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 108273#L11-4 merge_~i~0#1 := 0; 108272#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 108271#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 108270#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 108269#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 108268#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 108267#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 108266#L8 assume { :end_inline_merge } true; 108265#merge_sortFINAL assume true; 108259#merge_sortEXIT >#89#return; 108262#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 108431#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 108430#L12 assume !(merge_~j~0#1 == merge_~n#1); 108429#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 108428#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 108254#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 108251#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 108249#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 108247#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 108245#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 108243#L12 assume !(merge_~j~0#1 == merge_~n#1); 108241#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 108237#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 108238#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 109233#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 109231#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 109026#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 109016#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 109014#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 109015#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 109018#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 109017#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 108221#L11-4 merge_~i~0#1 := 0; 108219#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 108217#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 108215#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 108213#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 108211#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 108209#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 108207#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 108208#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 108397#L8 assume { :end_inline_merge } true; 108395#merge_sortFINAL assume true; 108391#merge_sortEXIT >#87#return; 108088#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 108388#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108386#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); 108168#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 108169#$Ultimate##0 [2022-12-13 17:51:14,989 INFO L750 eck$LassoCheckResult]: Loop: 108169#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108196#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); 108180#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 108187#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108196#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); 108180#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 108187#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108201#L24 assume ~n#1 < 2; 108421#merge_sortFINAL assume true; 108374#merge_sortEXIT >#87#return; 108322#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 108332#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108383#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); 108369#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 108373#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108200#L24 assume ~n#1 < 2; 108377#merge_sortFINAL assume true; 108368#merge_sortEXIT >#87#return; 108364#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 108366#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108375#L24 assume ~n#1 < 2; 108367#merge_sortFINAL assume true; 108363#merge_sortEXIT >#89#return; 108362#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 108361#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 108360#L12 assume !(merge_~j~0#1 == merge_~n#1); 108359#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 108356#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 108354#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 108352#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 108350#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 108348#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 108346#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 108344#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 108343#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 108342#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 108341#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 108340#L11-4 merge_~i~0#1 := 0; 108339#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 108338#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 108337#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 108336#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 108335#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 108334#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 108333#L8 assume { :end_inline_merge } true; 108331#merge_sortFINAL assume true; 108319#merge_sortEXIT >#89#return; 108329#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 109715#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 109714#L12 assume !(merge_~j~0#1 == merge_~n#1); 109713#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 109711#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 109712#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 109710#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 109708#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 109706#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 109704#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 109702#L12 assume !(merge_~j~0#1 == merge_~n#1); 109699#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 109695#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 109696#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 109701#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 109698#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 109694#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 109685#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 109683#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 109584#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 109582#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 109583#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 108220#L11-4 merge_~i~0#1 := 0; 108218#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 108216#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 108214#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 108212#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 108210#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 108206#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 108205#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 108203#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 108199#L8 assume { :end_inline_merge } true; 108188#merge_sortFINAL assume true; 108192#merge_sortEXIT >#87#return; 108174#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 108193#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 108172#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); 108176#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 108169#$Ultimate##0 [2022-12-13 17:51:14,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:51:14,989 INFO L85 PathProgramCache]: Analyzing trace with hash -735385190, now seen corresponding path program 20 times [2022-12-13 17:51:14,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:51:14,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506953048] [2022-12-13 17:51:14,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:51:14,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:51:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:51:15,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:51:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:51:15,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:51:15,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:51:15,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1921801960, now seen corresponding path program 1 times [2022-12-13 17:51:15,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:51:15,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627574163] [2022-12-13 17:51:15,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:51:15,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:51:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:51:15,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:51:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:51:15,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:51:15,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:51:15,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1970460385, now seen corresponding path program 21 times [2022-12-13 17:51:15,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:51:15,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299234330] [2022-12-13 17:51:15,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:51:15,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:51:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:15,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 17:51:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:16,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:51:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:16,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:51:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:16,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:51:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:16,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:51:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:16,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 17:51:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:51:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:16,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:51:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:16,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:51:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:16,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:51:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:51:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 174 proven. 374 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2022-12-13 17:51:16,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:51:16,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299234330] [2022-12-13 17:51:16,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299234330] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:51:16,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32019101] [2022-12-13 17:51:16,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:51:16,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:51:16,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:51:16,549 INFO L229 MonitoredProcess]: Starting monitored process 286 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:51:16,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (286)] Waiting until timeout for monitored process [2022-12-13 17:51:17,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-12-13 17:51:17,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:51:17,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 17:51:17,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:51:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 302 proven. 111 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2022-12-13 17:51:18,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:51:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 304 proven. 109 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2022-12-13 17:51:18,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32019101] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:51:18,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:51:18,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 24] total 54 [2022-12-13 17:51:18,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177738239] [2022-12-13 17:51:18,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:51:50,184 WARN L233 SmtUtils]: Spent 27.78s on a formula simplification. DAG size of input: 412 DAG size of output: 337 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:52:02,680 WARN L233 SmtUtils]: Spent 6.69s on a formula simplification that was a NOOP. DAG size: 196 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:52:10,171 WARN L233 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 190 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:52:24,779 WARN L233 SmtUtils]: Spent 14.53s on a formula simplification. DAG size of input: 223 DAG size of output: 221 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:52:33,660 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 179 DAG size of output: 168 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:52:44,000 WARN L233 SmtUtils]: Spent 10.30s on a formula simplification. DAG size of input: 189 DAG size of output: 188 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:52:49,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:52:49,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-13 17:52:49,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2547, Unknown=0, NotChecked=0, Total=2862 [2022-12-13 17:52:49,923 INFO L87 Difference]: Start difference. First operand 2050 states and 2349 transitions. cyclomatic complexity: 347 Second operand has 54 states, 43 states have (on average 3.2790697674418605) internal successors, (141), 43 states have internal predecessors, (141), 18 states have call successors, (27), 10 states have call predecessors, (27), 3 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2022-12-13 17:52:52,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:52:52,579 INFO L93 Difference]: Finished difference Result 5477 states and 6393 transitions. [2022-12-13 17:52:52,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5477 states and 6393 transitions. [2022-12-13 17:52:52,599 INFO L131 ngComponentsAnalysis]: Automaton has 73 accepting balls. 575 [2022-12-13 17:52:52,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5477 states to 5475 states and 6391 transitions. [2022-12-13 17:52:52,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3212 [2022-12-13 17:52:52,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3233 [2022-12-13 17:52:52,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5475 states and 6391 transitions. [2022-12-13 17:52:52,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:52:52,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5475 states and 6391 transitions. [2022-12-13 17:52:52,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states and 6391 transitions. [2022-12-13 17:52:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 3123. [2022-12-13 17:52:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 3018 states have (on average 1.1351888667992047) internal successors, (3426), 3009 states have internal predecessors, (3426), 73 states have call successors, (75), 41 states have call predecessors, (75), 32 states have return successors, (175), 72 states have call predecessors, (175), 63 states have call successors, (175) [2022-12-13 17:52:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 3676 transitions. [2022-12-13 17:52:52,653 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3123 states and 3676 transitions. [2022-12-13 17:52:52,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-12-13 17:52:52,653 INFO L428 stractBuchiCegarLoop]: Abstraction has 3123 states and 3676 transitions. [2022-12-13 17:52:52,654 INFO L335 stractBuchiCegarLoop]: ======== Iteration 37 ============ [2022-12-13 17:52:52,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3123 states and 3676 transitions. [2022-12-13 17:52:52,661 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 270 [2022-12-13 17:52:52,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:52:52,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:52:52,661 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 7, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-12-13 17:52:52,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-12-13 17:52:52,661 INFO L748 eck$LassoCheckResult]: Stem: 117267#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 117202#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 117203#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; 117205#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 117206#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 117207#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 117208#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 117209#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 117302#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 117301#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 117300#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 117299#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 117298#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 117297#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 117261#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 117262#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117621#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); 117588#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 117596#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117594#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); 117583#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 117586#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117590#L24 assume ~n#1 < 2; 117587#merge_sortFINAL assume true; 117580#merge_sortEXIT >#87#return; 117585#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 117578#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117673#L24 assume ~n#1 < 2; 117669#merge_sortFINAL assume true; 117664#merge_sortEXIT >#89#return; 117665#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 117832#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 117831#L12 assume !(merge_~j~0#1 == merge_~n#1); 117830#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 117827#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 117825#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 117823#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 117821#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 117819#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 117817#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 117815#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 117814#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 117813#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 117812#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 117811#L11-4 merge_~i~0#1 := 0; 117810#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 117809#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 117808#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 117807#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 117806#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 117805#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 117802#L8 assume { :end_inline_merge } true; 117799#merge_sortFINAL assume true; 117797#merge_sortEXIT >#87#return; 117212#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 117793#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117790#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); 117791#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 117223#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117803#L24 assume ~n#1 < 2; 117800#merge_sortFINAL assume true; 117798#merge_sortEXIT >#87#return; 117219#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 117804#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117801#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); 117222#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 117223#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117803#L24 assume ~n#1 < 2; 117800#merge_sortFINAL assume true; 117798#merge_sortEXIT >#87#return; 117251#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 117252#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 117255#L24 assume ~n#1 < 2; 117256#merge_sortFINAL assume true; 118310#merge_sortEXIT >#89#return; 118311#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 118384#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 118383#L12 assume !(merge_~j~0#1 == merge_~n#1); 118382#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 118381#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 118380#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 118379#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 118378#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 118377#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 118284#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 118285#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 118279#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 118280#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 118275#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 118276#L11-4 merge_~i~0#1 := 0; 118271#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 118272#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 119101#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 119100#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 119099#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 119098#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 119097#L8 assume { :end_inline_merge } true; 119096#merge_sortFINAL assume true; 117218#merge_sortEXIT >#89#return; 117220#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 120092#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 120091#L12 assume !(merge_~j~0#1 == merge_~n#1); 120089#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 120085#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 120086#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 120100#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 120099#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 120080#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 120081#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 120109#L12 assume !(merge_~j~0#1 == merge_~n#1); 120108#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 120107#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 120043#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 117199#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 117211#L12-2 [2022-12-13 17:52:52,662 INFO L750 eck$LassoCheckResult]: Loop: 117211#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 120103#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 120102#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 117210#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 117211#L12-2 [2022-12-13 17:52:52,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:52:52,662 INFO L85 PathProgramCache]: Analyzing trace with hash -349258925, now seen corresponding path program 22 times [2022-12-13 17:52:52,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:52:52,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588373804] [2022-12-13 17:52:52,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:52:52,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:52:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:52:52,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:52:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:52:52,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:52:52,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:52:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2032998, now seen corresponding path program 8 times [2022-12-13 17:52:52,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:52:52,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199421800] [2022-12-13 17:52:52,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:52:52,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:52:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:52:52,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:52:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:52:52,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:52:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:52:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash -201603144, now seen corresponding path program 23 times [2022-12-13 17:52:52,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:52:52,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138204096] [2022-12-13 17:52:52,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:52:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:52:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:52:52,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:52:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:52:52,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:53:17,593 WARN L233 SmtUtils]: Spent 9.48s on a formula simplification. DAG size of input: 233 DAG size of output: 223 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:53:49,480 WARN L233 SmtUtils]: Spent 16.43s on a formula simplification. DAG size of input: 277 DAG size of output: 262 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:53:58,752 WARN L233 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 238 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 17:53:58,758 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 17:53:58,758 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 17:53:58,758 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 17:53:58,758 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 17:53:58,758 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 17:53:58,758 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:53:58,758 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 17:53:58,758 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 17:53:58,758 INFO L133 ssoRankerPreferences]: Filename of dumped script: mergeSort.i_Iteration37_Lasso [2022-12-13 17:53:58,758 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 17:53:58,758 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 17:53:58,761 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:53:58,763 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:53:58,764 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:53:58,765 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:53:58,766 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:53:58,768 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:53:58,769 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:53:58,770 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,322 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,323 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,324 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,326 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,327 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,328 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,329 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,330 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,331 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,332 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,333 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,334 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,335 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:10,336 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 17:54:12,253 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 17:54:12,253 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 17:54:12,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:54:12,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:12,254 INFO L229 MonitoredProcess]: Starting monitored process 287 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:54:12,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Waiting until timeout for monitored process [2022-12-13 17:54:12,256 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 [2022-12-13 17:54:12,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:54:12,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:54:12,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:54:12,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:54:12,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:54:12,267 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:54:12,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:54:12,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:54:12,270 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (287)] Ended with exit code 0 [2022-12-13 17:54:12,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:54:12,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:12,271 INFO L229 MonitoredProcess]: Starting monitored process 288 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:54:12,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Waiting until timeout for monitored process [2022-12-13 17:54:12,273 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 [2022-12-13 17:54:12,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:54:12,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:54:12,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:54:12,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:54:12,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:54:12,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:54:12,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:54:12,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:54:12,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (288)] Ended with exit code 0 [2022-12-13 17:54:12,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:54:12,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:12,287 INFO L229 MonitoredProcess]: Starting monitored process 289 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:54:12,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Waiting until timeout for monitored process [2022-12-13 17:54:12,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 17:54:12,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:54:12,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:54:12,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:54:12,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:54:12,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:54:12,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:54:12,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:54:12,302 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:54:12,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (289)] Forceful destruction successful, exit code 0 [2022-12-13 17:54:12,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:54:12,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:12,305 INFO L229 MonitoredProcess]: Starting monitored process 290 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:54:12,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Waiting until timeout for monitored process [2022-12-13 17:54:12,307 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 [2022-12-13 17:54:12,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:54:12,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:54:12,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:54:12,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:54:12,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:54:12,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:54:12,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:54:12,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:54:12,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (290)] Ended with exit code 0 [2022-12-13 17:54:12,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:54:12,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:12,322 INFO L229 MonitoredProcess]: Starting monitored process 291 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:54:12,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Waiting until timeout for monitored process [2022-12-13 17:54:12,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 [2022-12-13 17:54:12,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:54:12,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:54:12,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:54:12,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:54:12,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:54:12,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:54:12,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:54:12,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (291)] Ended with exit code 0 [2022-12-13 17:54:12,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:54:12,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:12,341 INFO L229 MonitoredProcess]: Starting monitored process 292 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:54:12,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Waiting until timeout for monitored process [2022-12-13 17:54:12,343 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 [2022-12-13 17:54:12,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:54:12,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:54:12,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:54:12,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:54:12,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:54:12,355 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:54:12,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:54:12,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (292)] Ended with exit code 0 [2022-12-13 17:54:12,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:54:12,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:12,360 INFO L229 MonitoredProcess]: Starting monitored process 293 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:54:12,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Waiting until timeout for monitored process [2022-12-13 17:54:12,363 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 [2022-12-13 17:54:12,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:54:12,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 17:54:12,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:54:12,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:54:12,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:54:12,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 17:54:12,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 17:54:12,374 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 17:54:12,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (293)] Ended with exit code 0 [2022-12-13 17:54:12,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:54:12,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:12,378 INFO L229 MonitoredProcess]: Starting monitored process 294 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:54:12,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Waiting until timeout for monitored process [2022-12-13 17:54:12,380 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 [2022-12-13 17:54:12,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 17:54:12,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 17:54:12,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 17:54:12,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 17:54:12,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 17:54:12,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 17:54:12,436 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 17:54:12,594 INFO L443 ModelExtractionUtils]: Simplification made 29 calls to the SMT solver. [2022-12-13 17:54:12,594 INFO L444 ModelExtractionUtils]: 15 out of 76 variables were initially zero. Simplification set additionally 56 variables to zero. [2022-12-13 17:54:12,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 17:54:12,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:12,596 INFO L229 MonitoredProcess]: Starting monitored process 295 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 17:54:12,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Waiting until timeout for monitored process [2022-12-13 17:54:12,597 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 17:54:12,608 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-12-13 17:54:12,608 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 17:54:12,608 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length merge_sort_#in~a#1.base)_12, merge_sort_merge_~k~0#1) = 18446744073709551609*v_rep(select #length merge_sort_#in~a#1.base)_12 - 8*merge_sort_merge_~k~0#1 Supporting invariants [-1*v_rep(select #length merge_sort_merge_~x~0#1.base)_9 + 18446744073709551612 >= 0] [2022-12-13 17:54:12,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (294)] Ended with exit code 0 [2022-12-13 17:54:12,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (295)] Ended with exit code 0 [2022-12-13 17:54:12,926 INFO L156 tatePredicateManager]: 34 out of 38 supporting invariants were superfluous and have been removed [2022-12-13 17:54:12,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:54:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:13,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 17:54:13,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:54:13,377 INFO L350 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 [2022-12-13 17:54:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:13,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 17:54:13,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:54:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:54:13,528 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2022-12-13 17:54:13,528 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3123 states and 3676 transitions. cyclomatic complexity: 639 Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 17:54:13,669 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3123 states and 3676 transitions. cyclomatic complexity: 639. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 3207 states and 3768 transitions. Complement of second has 14 states. [2022-12-13 17:54:13,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2022-12-13 17:54:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 17:54:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-12-13 17:54:13,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 41 transitions. Stem has 114 letters. Loop has 4 letters. [2022-12-13 17:54:13,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:54:13,670 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:54:13,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:54:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:13,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 17:54:13,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:54:14,135 INFO L350 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 [2022-12-13 17:54:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:14,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 17:54:14,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:54:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:54:14,306 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2022-12-13 17:54:14,306 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3123 states and 3676 transitions. cyclomatic complexity: 639 Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 17:54:14,479 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3123 states and 3676 transitions. cyclomatic complexity: 639. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 3219 states and 3780 transitions. Complement of second has 14 states. [2022-12-13 17:54:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2022-12-13 17:54:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 17:54:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-12-13 17:54:14,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 114 letters. Loop has 4 letters. [2022-12-13 17:54:14,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:54:14,480 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 17:54:14,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:54:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:14,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 17:54:14,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:54:14,946 INFO L350 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 [2022-12-13 17:54:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:15,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 17:54:15,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:54:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:54:15,121 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2022-12-13 17:54:15,121 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3123 states and 3676 transitions. cyclomatic complexity: 639 Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 17:54:15,279 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3123 states and 3676 transitions. cyclomatic complexity: 639. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Result 5508 states and 6336 transitions. Complement of second has 16 states. [2022-12-13 17:54:15,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2022-12-13 17:54:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 17:54:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-12-13 17:54:15,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 61 transitions. Stem has 114 letters. Loop has 4 letters. [2022-12-13 17:54:15,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:54:15,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 61 transitions. Stem has 118 letters. Loop has 4 letters. [2022-12-13 17:54:15,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:54:15,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 61 transitions. Stem has 114 letters. Loop has 8 letters. [2022-12-13 17:54:15,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 17:54:15,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5508 states and 6336 transitions. [2022-12-13 17:54:15,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-12-13 17:54:15,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5508 states to 2575 states and 3006 transitions. [2022-12-13 17:54:15,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 456 [2022-12-13 17:54:15,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 456 [2022-12-13 17:54:15,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2575 states and 3006 transitions. [2022-12-13 17:54:15,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:54:15,310 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2575 states and 3006 transitions. [2022-12-13 17:54:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states and 3006 transitions. [2022-12-13 17:54:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2323. [2022-12-13 17:54:15,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2323 states, 2257 states have (on average 1.1369073992024812) internal successors, (2566), 2251 states have internal predecessors, (2566), 42 states have call successors, (43), 25 states have call predecessors, (43), 24 states have return successors, (113), 46 states have call predecessors, (113), 39 states have call successors, (113) [2022-12-13 17:54:15,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 2722 transitions. [2022-12-13 17:54:15,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2323 states and 2722 transitions. [2022-12-13 17:54:15,328 INFO L428 stractBuchiCegarLoop]: Abstraction has 2323 states and 2722 transitions. [2022-12-13 17:54:15,328 INFO L335 stractBuchiCegarLoop]: ======== Iteration 38 ============ [2022-12-13 17:54:15,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2323 states and 2722 transitions. [2022-12-13 17:54:15,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-12-13 17:54:15,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:54:15,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:54:15,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [17, 17, 17, 16, 15, 15, 15, 15, 13, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2022-12-13 17:54:15,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 15, 13, 13, 13, 11, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5] [2022-12-13 17:54:15,335 INFO L748 eck$LassoCheckResult]: Stem: 133627#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 133573#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 133574#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; 133576#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133577#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133578#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133579#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133580#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133655#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133654#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133653#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133652#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133651#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133650#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133649#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133648#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133647#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133646#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133645#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133644#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133643#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133642#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133641#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133640#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133639#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133638#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133637#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133636#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133635#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133634#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133633#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133632#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 133631#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 133630#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 133622#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 133623#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133656#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); 133559#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133603#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133604#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); 133618#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133668#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133617#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); 133619#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133668#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133617#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); 133619#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133668#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133882#L24 assume ~n#1 < 2; 133880#merge_sortFINAL assume true; 133878#merge_sortEXIT >#87#return; 133589#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 133601#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133602#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); 133588#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133590#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133932#L24 assume ~n#1 < 2; 133931#merge_sortFINAL assume true; 133929#merge_sortEXIT >#87#return; 133926#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 133927#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133930#L24 assume ~n#1 < 2; 133928#merge_sortFINAL assume true; 133925#merge_sortEXIT >#89#return; 133924#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 133923#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133922#L12 assume !(merge_~j~0#1 == merge_~n#1); 133921#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 133919#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 133917#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 133915#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 133913#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133911#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133909#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133907#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 133891#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133890#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133889#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 133888#L11-4 merge_~i~0#1 := 0; 133887#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133886#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133885#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133884#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133883#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 133881#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 133879#L8 assume { :end_inline_merge } true; 133877#merge_sortFINAL assume true; 133875#merge_sortEXIT >#89#return; 133874#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 133873#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133872#L12 assume !(merge_~j~0#1 == merge_~n#1); 133871#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 133869#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 133868#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 133867#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 133866#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133865#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133864#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133863#L12 assume !(merge_~j~0#1 == merge_~n#1); 133862#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 133859#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 133857#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 133855#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 133853#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133851#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133849#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133846#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 133847#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133835#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133836#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 133830#L11-4 merge_~i~0#1 := 0; 133829#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133828#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133827#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133826#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133825#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133824#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133823#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 133822#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 133821#L8 assume { :end_inline_merge } true; 133820#merge_sortFINAL assume true; 133819#merge_sortEXIT >#87#return; 133772#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 133812#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133807#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); 133613#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133774#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133788#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); 133778#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133783#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133670#L24 assume ~n#1 < 2; 133786#merge_sortFINAL assume true; 133776#merge_sortEXIT >#87#return; 133608#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 133615#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 134011#L24 assume ~n#1 < 2; 134010#merge_sortFINAL assume true; 134008#merge_sortEXIT >#89#return; 134007#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 134005#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 134003#L12 assume !(merge_~j~0#1 == merge_~n#1); 134002#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 134000#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 133998#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 133996#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 133994#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133992#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133990#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133988#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 133805#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133804#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133803#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 133794#L11-4 merge_~i~0#1 := 0; 133793#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133792#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133791#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133790#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133789#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 133787#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 133785#L8 assume { :end_inline_merge } true; 133771#merge_sortFINAL assume true; 133764#merge_sortEXIT >#87#return; 133610#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 133775#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133938#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); 133781#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133784#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133671#L24 assume ~n#1 < 2; 133796#merge_sortFINAL assume true; 133779#merge_sortEXIT >#87#return; 133608#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 133615#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 134011#L24 assume ~n#1 < 2; 134010#merge_sortFINAL assume true; 134008#merge_sortEXIT >#89#return; 134007#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 134005#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 134003#L12 assume !(merge_~j~0#1 == merge_~n#1); 134002#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 134000#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 133998#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 133996#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 133994#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133992#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133990#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133988#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 133805#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133804#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133803#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 133794#L11-4 merge_~i~0#1 := 0; 133793#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133792#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133791#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133790#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133789#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 133787#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 133785#L8 assume { :end_inline_merge } true; 133771#merge_sortFINAL assume true; 133764#merge_sortEXIT >#89#return; 133769#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 134614#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 134613#L12 assume !(merge_~j~0#1 == merge_~n#1); 134612#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 134610#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 134609#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 134608#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 134607#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 134606#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 134605#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 134604#L12 assume !(merge_~j~0#1 == merge_~n#1); 134602#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 134599#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 134597#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 134595#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 134593#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 134592#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 134590#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 134585#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 134586#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 134591#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 134589#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 134345#L11-4 merge_~i~0#1 := 0; 134343#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 134341#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 134040#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 134032#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 134030#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 134031#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 134332#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 134330#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 134328#L8 assume { :end_inline_merge } true; 134326#merge_sortFINAL assume true; 134324#merge_sortEXIT >#89#return; 133586#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 134320#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 134318#L12 assume !(merge_~j~0#1 == merge_~n#1); 134316#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 134312#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 134313#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 134405#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 134404#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 134403#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 134402#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 134401#L12 assume !(merge_~j~0#1 == merge_~n#1); 134400#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 134398#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 134399#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 134418#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 134410#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 134411#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 134388#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 134389#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 134431#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 134429#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 134428#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 134427#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 134426#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 134425#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 134202#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 134037#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 134038#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 134204#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 134203#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 133693#L11-4 merge_~i~0#1 := 0; 133692#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133691#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133690#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133689#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133688#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133687#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133686#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 133685#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 133684#L8 assume { :end_inline_merge } true; 133683#merge_sortFINAL assume true; 133661#merge_sortEXIT >#87#return; 133567#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 133660#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133659#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); 133594#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133658#$Ultimate##0 [2022-12-13 17:54:15,336 INFO L750 eck$LassoCheckResult]: Loop: 133658#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133669#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); 133591#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133595#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133669#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); 133591#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133595#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133669#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); 133591#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133595#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133670#L24 assume ~n#1 < 2; 133786#merge_sortFINAL assume true; 133776#merge_sortEXIT >#87#return; 133614#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 133770#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133950#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); 133781#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133784#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133671#L24 assume ~n#1 < 2; 133796#merge_sortFINAL assume true; 133779#merge_sortEXIT >#87#return; 133608#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 133615#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 134011#L24 assume ~n#1 < 2; 134010#merge_sortFINAL assume true; 134008#merge_sortEXIT >#89#return; 134007#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 134005#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 134003#L12 assume !(merge_~j~0#1 == merge_~n#1); 134002#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 134000#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 133998#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 133996#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 133994#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133992#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133990#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133988#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 133805#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133804#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133803#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 133794#L11-4 merge_~i~0#1 := 0; 133793#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133792#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133791#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133790#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133789#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 133787#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 133785#L8 assume { :end_inline_merge } true; 133771#merge_sortFINAL assume true; 133764#merge_sortEXIT >#89#return; 133763#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 133762#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133761#L12 assume !(merge_~j~0#1 == merge_~n#1); 133760#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 133758#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 133757#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 133756#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 133755#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133754#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133753#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133752#L12 assume !(merge_~j~0#1 == merge_~n#1); 133751#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 133748#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 133746#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 133744#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 133742#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133740#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133738#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133735#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 133736#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133729#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133730#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 133727#L11-4 merge_~i~0#1 := 0; 133726#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133725#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133724#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133723#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133722#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133721#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133720#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 133719#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 133718#L8 assume { :end_inline_merge } true; 133716#merge_sortFINAL assume true; 133705#merge_sortEXIT >#87#return; 133701#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 133702#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133806#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); 133612#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133774#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133671#L24 assume ~n#1 < 2; 133796#merge_sortFINAL assume true; 133779#merge_sortEXIT >#87#return; 133614#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 133770#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133950#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); 133781#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133784#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133671#L24 assume ~n#1 < 2; 133796#merge_sortFINAL assume true; 133779#merge_sortEXIT >#87#return; 133608#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 133615#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 134011#L24 assume ~n#1 < 2; 134010#merge_sortFINAL assume true; 134008#merge_sortEXIT >#89#return; 134007#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 134005#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 134003#L12 assume !(merge_~j~0#1 == merge_~n#1); 134002#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 134000#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 133998#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 133996#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 133994#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133992#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133990#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133988#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 133805#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133804#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133803#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 133794#L11-4 merge_~i~0#1 := 0; 133793#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133792#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133791#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133790#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133789#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 133787#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 133785#L8 assume { :end_inline_merge } true; 133771#merge_sortFINAL assume true; 133764#merge_sortEXIT >#89#return; 133763#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 133762#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133761#L12 assume !(merge_~j~0#1 == merge_~n#1); 133760#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 133758#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 133757#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 133756#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 133755#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133754#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133753#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133752#L12 assume !(merge_~j~0#1 == merge_~n#1); 133751#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 133748#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 133746#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 133744#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 133742#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133740#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133738#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 133735#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 133736#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 133729#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 133730#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 133727#L11-4 merge_~i~0#1 := 0; 133726#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133725#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133724#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133723#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133722#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133721#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133720#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 133719#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 133718#L8 assume { :end_inline_merge } true; 133716#merge_sortFINAL assume true; 133705#merge_sortEXIT >#89#return; 133711#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 135409#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 135408#L12 assume !(merge_~j~0#1 == merge_~n#1); 135407#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 135368#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 135369#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 135391#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 135389#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 135388#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 135387#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 135385#L12 assume !(merge_~j~0#1 == merge_~n#1); 135383#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 135380#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 135381#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 135386#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 135384#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 135382#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 135379#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 135377#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 135375#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 135373#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 135371#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 135301#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 135299#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 135297#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 135295#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 135236#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 135237#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 135306#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 135294#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 133980#L11-4 merge_~i~0#1 := 0; 133981#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133974#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133975#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133842#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133843#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 133832#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 133833#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 133810#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 133811#L8 assume { :end_inline_merge } true; 133672#merge_sortFINAL assume true; 133675#merge_sortEXIT >#87#return; 133663#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 133676#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 133802#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); 133593#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 133658#$Ultimate##0 [2022-12-13 17:54:15,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:54:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash -164459408, now seen corresponding path program 24 times [2022-12-13 17:54:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:54:15,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363784625] [2022-12-13 17:54:15,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:54:15,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:54:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:16,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 17:54:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:16,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:16,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:16,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:54:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:16,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:16,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:54:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:16,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 17:54:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:17,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:17,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:17,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:54:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:17,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 17:54:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:17,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:17,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:54:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1858 backedges. 1041 proven. 399 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2022-12-13 17:54:17,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:54:17,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363784625] [2022-12-13 17:54:17,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363784625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:54:17,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332330882] [2022-12-13 17:54:17,220 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 17:54:17,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:54:17,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:17,221 INFO L229 MonitoredProcess]: Starting monitored process 296 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:54:17,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (296)] Waiting until timeout for monitored process [2022-12-13 17:54:49,199 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-12-13 17:54:49,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:54:49,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 1416 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 17:54:49,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:54:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1858 backedges. 557 proven. 26 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2022-12-13 17:54:49,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:54:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1858 backedges. 557 proven. 26 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2022-12-13 17:54:49,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332330882] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:54:49,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:54:49,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 12, 12] total 54 [2022-12-13 17:54:49,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610324780] [2022-12-13 17:54:49,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:54:49,675 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:54:49,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:54:49,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1351370896, now seen corresponding path program 2 times [2022-12-13 17:54:49,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:54:49,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172385948] [2022-12-13 17:54:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:54:49,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:54:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:50,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:50,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:50,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:50,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:50,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:54:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:50,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:50,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:54:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:50,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 17:54:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:50,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:50,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:54:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:50,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:50,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:54:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:50,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 746 proven. 148 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2022-12-13 17:54:50,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:54:50,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172385948] [2022-12-13 17:54:50,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172385948] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:54:50,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338466435] [2022-12-13 17:54:50,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:54:50,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:54:50,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:50,818 INFO L229 MonitoredProcess]: Starting monitored process 297 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:54:50,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (297)] Waiting until timeout for monitored process [2022-12-13 17:54:51,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:54:51,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:54:51,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 17:54:51,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:54:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 666 proven. 77 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-12-13 17:54:51,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:54:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 675 proven. 68 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-12-13 17:54:51,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338466435] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:54:51,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:54:51,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 27 [2022-12-13 17:54:51,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376141040] [2022-12-13 17:54:51,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:54:51,473 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 17:54:51,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:54:51,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 17:54:51,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2022-12-13 17:54:51,474 INFO L87 Difference]: Start difference. First operand 2323 states and 2722 transitions. cyclomatic complexity: 462 Second operand has 27 states, 26 states have (on average 6.0) internal successors, (156), 24 states have internal predecessors, (156), 6 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 8 states have call predecessors, (12), 5 states have call successors, (12) [2022-12-13 17:54:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:54:52,739 INFO L93 Difference]: Finished difference Result 3160 states and 3768 transitions. [2022-12-13 17:54:52,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3160 states and 3768 transitions. [2022-12-13 17:54:52,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-12-13 17:54:52,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3160 states to 3160 states and 3768 transitions. [2022-12-13 17:54:52,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 528 [2022-12-13 17:54:52,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 528 [2022-12-13 17:54:52,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3160 states and 3768 transitions. [2022-12-13 17:54:52,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:54:52,761 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3160 states and 3768 transitions. [2022-12-13 17:54:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3160 states and 3768 transitions. [2022-12-13 17:54:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3160 to 2595. [2022-12-13 17:54:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 2527 states have (on average 1.1404827859121487) internal successors, (2882), 2524 states have internal predecessors, (2882), 44 states have call successors, (45), 25 states have call predecessors, (45), 24 states have return successors, (106), 45 states have call predecessors, (106), 41 states have call successors, (106) [2022-12-13 17:54:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3033 transitions. [2022-12-13 17:54:52,784 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2595 states and 3033 transitions. [2022-12-13 17:54:52,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-13 17:54:52,785 INFO L428 stractBuchiCegarLoop]: Abstraction has 2595 states and 3033 transitions. [2022-12-13 17:54:52,785 INFO L335 stractBuchiCegarLoop]: ======== Iteration 39 ============ [2022-12-13 17:54:52,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2595 states and 3033 transitions. [2022-12-13 17:54:52,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-12-13 17:54:52,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:54:52,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:54:52,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [17, 17, 17, 17, 15, 15, 15, 15, 13, 11, 11, 10, 10, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 1, 1, 1, 1, 1, 1] [2022-12-13 17:54:52,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 19, 17, 17, 17, 15, 12, 12, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 3, 1] [2022-12-13 17:54:52,793 INFO L748 eck$LassoCheckResult]: Stem: 143194#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 143146#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 143147#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; 143149#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143150#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143151#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143152#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143153#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143226#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143225#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143224#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143223#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143222#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143221#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143220#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143219#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143218#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143217#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143216#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143215#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143214#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143213#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143212#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143211#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143210#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143209#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143208#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143207#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143206#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143205#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143204#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143203#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 143202#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 143201#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 143192#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 143193#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143227#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); 143241#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143253#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143356#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); 143129#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143178#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143179#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); 143130#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143178#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143179#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); 143130#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143178#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143179#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); 143130#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143178#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143180#L24 assume ~n#1 < 2; 143408#merge_sortFINAL assume true; 143407#merge_sortEXIT >#87#return; 143164#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143406#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143357#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); 143163#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143165#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143524#L24 assume ~n#1 < 2; 143523#merge_sortFINAL assume true; 143522#merge_sortEXIT >#87#return; 143185#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143186#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143520#L24 assume ~n#1 < 2; 143519#merge_sortFINAL assume true; 143518#merge_sortEXIT >#89#return; 143517#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 143516#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143515#L12 assume !(merge_~j~0#1 == merge_~n#1); 143514#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 143511#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 143509#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 143507#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143505#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143503#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143501#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143499#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 143498#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143497#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143496#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 143495#L11-4 merge_~i~0#1 := 0; 143494#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143493#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143492#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143491#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143490#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 143489#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 143488#L8 assume { :end_inline_merge } true; 143487#merge_sortFINAL assume true; 143486#merge_sortEXIT >#89#return; 143485#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 143484#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143483#L12 assume !(merge_~j~0#1 == merge_~n#1); 143482#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 143481#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 143479#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 143477#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143475#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143473#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143471#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143469#L12 assume !(merge_~j~0#1 == merge_~n#1); 143467#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 143464#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 143462#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 143460#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143458#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143456#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143454#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143451#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 143452#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143447#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143448#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 143402#L11-4 merge_~i~0#1 := 0; 143400#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143397#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143395#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143393#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143391#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143388#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143387#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 143385#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 143383#L8 assume { :end_inline_merge } true; 143380#merge_sortFINAL assume true; 143379#merge_sortEXIT >#87#return; 143139#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143374#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143375#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); 143291#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143297#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143351#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); 143339#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143340#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143243#L24 assume ~n#1 < 2; 143348#merge_sortFINAL assume true; 143341#merge_sortEXIT >#87#return; 143330#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143332#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143344#L24 assume ~n#1 < 2; 143334#merge_sortFINAL assume true; 143329#merge_sortEXIT >#89#return; 143328#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 143327#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143326#L12 assume !(merge_~j~0#1 == merge_~n#1); 143325#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 143322#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 143320#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 143318#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143316#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143314#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143312#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143310#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 143309#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143308#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143307#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 143306#L11-4 merge_~i~0#1 := 0; 143305#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143304#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143303#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143302#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143301#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 143300#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 143299#L8 assume { :end_inline_merge } true; 143296#merge_sortFINAL assume true; 143283#merge_sortEXIT >#87#return; 143284#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143298#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143346#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); 143336#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143343#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143244#L24 assume ~n#1 < 2; 143345#merge_sortFINAL assume true; 143335#merge_sortEXIT >#87#return; 143330#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143332#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143344#L24 assume ~n#1 < 2; 143334#merge_sortFINAL assume true; 143329#merge_sortEXIT >#89#return; 143328#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 143327#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143326#L12 assume !(merge_~j~0#1 == merge_~n#1); 143325#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 143322#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 143320#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 143318#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143316#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143314#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143312#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143310#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 143309#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143308#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143307#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 143306#L11-4 merge_~i~0#1 := 0; 143305#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143304#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143303#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143302#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143301#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 143300#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 143299#L8 assume { :end_inline_merge } true; 143296#merge_sortFINAL assume true; 143283#merge_sortEXIT >#89#return; 143292#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 144022#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144021#L12 assume !(merge_~j~0#1 == merge_~n#1); 144020#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 144019#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 144017#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 144014#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 144011#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 144008#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144004#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144000#L12 assume !(merge_~j~0#1 == merge_~n#1); 143995#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 143989#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 143990#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 144053#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143949#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143950#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143942#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143941#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 143947#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143948#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143940#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 143930#L11-4 merge_~i~0#1 := 0; 143928#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143926#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143924#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143921#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143918#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143914#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143913#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 143134#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 143141#L8 assume { :end_inline_merge } true; 143148#merge_sortFINAL assume true; 143693#merge_sortEXIT >#89#return; 143691#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 143690#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143689#L12 assume !(merge_~j~0#1 == merge_~n#1); 143688#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 143685#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 143687#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 143900#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143899#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143898#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143897#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143896#L12 assume !(merge_~j~0#1 == merge_~n#1); 143895#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 143894#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143893#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143892#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143891#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143890#L12 assume !(merge_~j~0#1 == merge_~n#1); 143889#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 143887#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143885#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143883#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143880#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143881#L12 assume !(merge_~j~0#1 == merge_~n#1); 143774#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 143772#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143770#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143768#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143765#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143757#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 143603#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143607#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143605#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 143545#L11-4 merge_~i~0#1 := 0; 143543#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143541#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143539#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143537#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143535#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143532#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143531#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 143529#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 143527#L8 assume { :end_inline_merge } true; 143521#merge_sortFINAL assume true; 143237#merge_sortEXIT >#87#return; 143138#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143234#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143235#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); 143167#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143229#$Ultimate##0 [2022-12-13 17:54:52,794 INFO L750 eck$LassoCheckResult]: Loop: 143229#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143242#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); 143166#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143170#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143242#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); 143166#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143170#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143242#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); 143166#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143170#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143242#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); 143166#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143170#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143243#L24 assume ~n#1 < 2; 143348#merge_sortFINAL assume true; 143341#merge_sortEXIT >#87#return; 143289#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143333#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143347#L24 assume ~n#1 < 2; 143334#merge_sortFINAL assume true; 143329#merge_sortEXIT >#89#return; 143328#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 143327#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143326#L12 assume !(merge_~j~0#1 == merge_~n#1); 143325#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 143322#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 143320#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 143318#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143316#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143314#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143312#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143310#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 143309#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143308#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143307#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 143306#L11-4 merge_~i~0#1 := 0; 143305#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143304#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143303#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143302#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143301#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 143300#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 143299#L8 assume { :end_inline_merge } true; 143296#merge_sortFINAL assume true; 143283#merge_sortEXIT >#87#return; 143262#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143270#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143352#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); 143338#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143343#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143244#L24 assume ~n#1 < 2; 143345#merge_sortFINAL assume true; 143335#merge_sortEXIT >#87#return; 143289#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143333#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143347#L24 assume ~n#1 < 2; 143334#merge_sortFINAL assume true; 143329#merge_sortEXIT >#89#return; 143328#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 143327#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143326#L12 assume !(merge_~j~0#1 == merge_~n#1); 143325#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 143322#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 143320#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 143318#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143316#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143314#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143312#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143310#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 143309#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143308#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143307#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 143306#L11-4 merge_~i~0#1 := 0; 143305#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143304#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143303#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143302#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143301#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 143300#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 143299#L8 assume { :end_inline_merge } true; 143296#merge_sortFINAL assume true; 143283#merge_sortEXIT >#89#return; 143295#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 144148#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144146#L12 assume !(merge_~j~0#1 == merge_~n#1); 144144#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 144140#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 144137#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 144135#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 144133#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 144132#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144131#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144111#L12 assume !(merge_~j~0#1 == merge_~n#1); 144107#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 144103#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 144100#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 144097#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 144095#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 144094#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144092#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144088#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 144089#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 144093#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144091#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 144080#L11-4 merge_~i~0#1 := 0; 144079#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 144078#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 144077#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 144076#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 144075#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 144074#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 144073#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 144072#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 144071#L8 assume { :end_inline_merge } true; 144070#merge_sortFINAL assume true; 144058#merge_sortEXIT >#87#return; 143249#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143247#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143282#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); 143263#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143268#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143353#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); 143342#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143340#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143243#L24 assume ~n#1 < 2; 143348#merge_sortFINAL assume true; 143341#merge_sortEXIT >#87#return; 143289#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143333#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143347#L24 assume ~n#1 < 2; 143334#merge_sortFINAL assume true; 143329#merge_sortEXIT >#89#return; 143328#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 143327#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143326#L12 assume !(merge_~j~0#1 == merge_~n#1); 143325#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 143322#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 143320#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 143318#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143316#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143314#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143312#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143310#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 143309#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143308#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143307#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 143306#L11-4 merge_~i~0#1 := 0; 143305#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143304#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143303#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143302#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143301#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 143300#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 143299#L8 assume { :end_inline_merge } true; 143296#merge_sortFINAL assume true; 143283#merge_sortEXIT >#87#return; 143262#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143270#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143352#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); 143338#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143343#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143244#L24 assume ~n#1 < 2; 143345#merge_sortFINAL assume true; 143335#merge_sortEXIT >#87#return; 143289#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143333#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143347#L24 assume ~n#1 < 2; 143334#merge_sortFINAL assume true; 143329#merge_sortEXIT >#89#return; 143328#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 143327#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143326#L12 assume !(merge_~j~0#1 == merge_~n#1); 143325#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 143322#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 143320#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 143318#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 143316#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143314#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143312#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 143310#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 143309#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 143308#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 143307#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 143306#L11-4 merge_~i~0#1 := 0; 143305#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143304#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143303#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143302#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143301#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 143300#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 143299#L8 assume { :end_inline_merge } true; 143296#merge_sortFINAL assume true; 143283#merge_sortEXIT >#89#return; 143295#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 144148#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144146#L12 assume !(merge_~j~0#1 == merge_~n#1); 144144#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 144140#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 144137#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 144135#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 144133#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 144132#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144131#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144111#L12 assume !(merge_~j~0#1 == merge_~n#1); 144107#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 144103#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 144100#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 144097#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 144095#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 144094#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144092#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144088#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 144089#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 144093#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144091#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 144080#L11-4 merge_~i~0#1 := 0; 144079#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 144078#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 144077#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 144076#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 144075#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 144074#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 144073#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 144072#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 144071#L8 assume { :end_inline_merge } true; 144070#merge_sortFINAL assume true; 144058#merge_sortEXIT >#89#return; 143239#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 144525#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144524#L12 assume !(merge_~j~0#1 == merge_~n#1); 144523#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 144521#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 144520#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 144519#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 144518#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 144517#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144516#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144515#L12 assume !(merge_~j~0#1 == merge_~n#1); 144513#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 144514#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 144646#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 144642#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144638#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144632#L12 assume !(merge_~j~0#1 == merge_~n#1); 144628#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 144626#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 144624#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 144622#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144620#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144618#L12 assume !(merge_~j~0#1 == merge_~n#1); 144595#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 144592#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 144589#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 144586#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144582#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 144577#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 144440#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 144443#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 144442#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 143595#L11-4 merge_~i~0#1 := 0; 143596#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143591#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143592#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143587#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143588#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 143584#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 143585#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 143579#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 143580#L8 assume { :end_inline_merge } true; 143245#merge_sortFINAL assume true; 143238#merge_sortEXIT >#87#return; 143231#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 143236#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 143230#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); 143169#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 143229#$Ultimate##0 [2022-12-13 17:54:52,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:54:52,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1989404830, now seen corresponding path program 6 times [2022-12-13 17:54:52,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:54:52,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956194763] [2022-12-13 17:54:52,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:54:52,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:54:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 17:54:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:54:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:54:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 17:54:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:54:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 17:54:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:54:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:54:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:54:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1921 backedges. 1090 proven. 85 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2022-12-13 17:54:53,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:54:53,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956194763] [2022-12-13 17:54:53,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956194763] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:54:53,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307944324] [2022-12-13 17:54:53,944 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 17:54:53,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:54:53,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:54:53,945 INFO L229 MonitoredProcess]: Starting monitored process 298 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:54:53,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (298)] Waiting until timeout for monitored process [2022-12-13 17:55:01,422 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-12-13 17:55:01,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:55:01,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 17:55:01,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:55:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1921 backedges. 586 proven. 319 refuted. 0 times theorem prover too weak. 1016 trivial. 0 not checked. [2022-12-13 17:55:01,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:55:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1921 backedges. 586 proven. 319 refuted. 0 times theorem prover too weak. 1016 trivial. 0 not checked. [2022-12-13 17:55:01,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307944324] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:55:01,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:55:01,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 19 [2022-12-13 17:55:01,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83348294] [2022-12-13 17:55:01,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:55:01,721 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:55:01,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:55:01,721 INFO L85 PathProgramCache]: Analyzing trace with hash 626286190, now seen corresponding path program 1 times [2022-12-13 17:55:01,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:55:01,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114005669] [2022-12-13 17:55:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:01,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:55:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:55:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 17:55:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:55:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 17:55:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:55:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 17:55:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:55:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2084 backedges. 1328 proven. 110 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2022-12-13 17:55:02,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:55:02,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114005669] [2022-12-13 17:55:02,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114005669] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:55:02,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582260598] [2022-12-13 17:55:02,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:02,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:55:02,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:55:02,831 INFO L229 MonitoredProcess]: Starting monitored process 299 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:55:02,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (299)] Waiting until timeout for monitored process [2022-12-13 17:55:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:03,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 1541 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 17:55:03,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:55:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2084 backedges. 1031 proven. 109 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2022-12-13 17:55:03,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:55:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2084 backedges. 683 proven. 679 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2022-12-13 17:55:03,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582260598] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:55:03,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:55:03,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 27 [2022-12-13 17:55:03,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248631058] [2022-12-13 17:55:03,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:55:03,574 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 17:55:03,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:55:03,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 17:55:03,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2022-12-13 17:55:03,574 INFO L87 Difference]: Start difference. First operand 2595 states and 3033 transitions. cyclomatic complexity: 509 Second operand has 27 states, 25 states have (on average 6.2) internal successors, (155), 22 states have internal predecessors, (155), 7 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (17), 9 states have call predecessors, (17), 7 states have call successors, (17) [2022-12-13 17:55:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:55:03,956 INFO L93 Difference]: Finished difference Result 3162 states and 3658 transitions. [2022-12-13 17:55:03,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3162 states and 3658 transitions. [2022-12-13 17:55:03,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-12-13 17:55:03,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3162 states to 3162 states and 3658 transitions. [2022-12-13 17:55:03,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 410 [2022-12-13 17:55:03,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 410 [2022-12-13 17:55:03,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3162 states and 3658 transitions. [2022-12-13 17:55:03,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:55:03,979 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3162 states and 3658 transitions. [2022-12-13 17:55:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states and 3658 transitions. [2022-12-13 17:55:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 2856. [2022-12-13 17:55:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2788 states have (on average 1.1362984218077474) internal successors, (3168), 2785 states have internal predecessors, (3168), 44 states have call successors, (45), 25 states have call predecessors, (45), 24 states have return successors, (106), 45 states have call predecessors, (106), 41 states have call successors, (106) [2022-12-13 17:55:04,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 3319 transitions. [2022-12-13 17:55:04,003 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2856 states and 3319 transitions. [2022-12-13 17:55:04,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 17:55:04,004 INFO L428 stractBuchiCegarLoop]: Abstraction has 2856 states and 3319 transitions. [2022-12-13 17:55:04,004 INFO L335 stractBuchiCegarLoop]: ======== Iteration 40 ============ [2022-12-13 17:55:04,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2856 states and 3319 transitions. [2022-12-13 17:55:04,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-12-13 17:55:04,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:55:04,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:55:04,015 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 15, 15, 15, 14, 13, 13, 11, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1] [2022-12-13 17:55:04,015 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 21, 17, 17, 17, 15, 12, 12, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 3, 1] [2022-12-13 17:55:04,015 INFO L748 eck$LassoCheckResult]: Stem: 153609#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 153550#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 153551#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; 153554#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153555#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153556#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153557#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153558#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153642#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153641#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153640#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153639#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153638#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153637#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153636#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153635#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153634#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153633#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153632#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153631#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153630#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153629#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153628#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153627#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153626#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153625#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153624#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153623#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153622#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153621#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153620#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153619#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 153618#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 153617#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 153607#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 153608#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153643#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); 153602#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153666#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153601#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); 153532#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153590#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153591#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); 153533#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153590#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153591#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); 153533#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153590#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153592#L24 assume ~n#1 < 2; 153863#merge_sortFINAL assume true; 153860#merge_sortEXIT >#87#return; 153579#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153855#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153853#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); 153578#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153580#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153890#L24 assume ~n#1 < 2; 153888#merge_sortFINAL assume true; 153884#merge_sortEXIT >#87#return; 153588#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153587#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153589#L24 assume ~n#1 < 2; 153600#merge_sortFINAL assume true; 153995#merge_sortEXIT >#89#return; 153994#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 153993#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153992#L12 assume !(merge_~j~0#1 == merge_~n#1); 153991#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 153988#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 153986#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 153984#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 153982#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153980#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153978#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153976#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 153975#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153974#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153973#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 153972#L11-4 merge_~i~0#1 := 0; 153971#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153970#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153969#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153968#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153967#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 153966#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 153965#L8 assume { :end_inline_merge } true; 153964#merge_sortFINAL assume true; 153963#merge_sortEXIT >#89#return; 153962#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 153961#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153960#L12 assume !(merge_~j~0#1 == merge_~n#1); 153958#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 153957#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 153956#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 153954#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 153952#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153950#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153948#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153946#L12 assume !(merge_~j~0#1 == merge_~n#1); 153944#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 153941#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 153939#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 153937#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 153935#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153933#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153931#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153929#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 153925#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153922#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153923#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 153919#L11-4 merge_~i~0#1 := 0; 153918#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153917#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153916#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153915#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153914#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153913#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153912#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 153911#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 153910#L8 assume { :end_inline_merge } true; 153909#merge_sortFINAL assume true; 153907#merge_sortEXIT >#87#return; 153543#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153836#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153835#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); 153766#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153779#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153654#L24 assume ~n#1 < 2; 153887#merge_sortFINAL assume true; 153816#merge_sortEXIT >#87#return; 153772#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153777#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153840#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); 153819#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153824#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153654#L24 assume ~n#1 < 2; 153887#merge_sortFINAL assume true; 153816#merge_sortEXIT >#87#return; 153811#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153813#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153825#L24 assume ~n#1 < 2; 153815#merge_sortFINAL assume true; 153810#merge_sortEXIT >#89#return; 153809#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 153808#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153807#L12 assume !(merge_~j~0#1 == merge_~n#1); 153806#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 153803#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 153801#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 153799#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 153797#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153795#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153793#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153791#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 153790#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153789#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153788#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 153787#L11-4 merge_~i~0#1 := 0; 153786#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153785#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153784#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153783#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153782#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 153781#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 153780#L8 assume { :end_inline_merge } true; 153778#merge_sortFINAL assume true; 153765#merge_sortEXIT >#89#return; 153776#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 154930#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 154929#L12 assume !(merge_~j~0#1 == merge_~n#1); 154928#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 154927#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 154926#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 154924#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 154922#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 154920#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 154918#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 154916#L12 assume !(merge_~j~0#1 == merge_~n#1); 154914#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 154911#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 154909#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 154907#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 154905#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 154901#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 154899#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 154896#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 154895#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 154893#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 154894#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 154015#L11-4 merge_~i~0#1 := 0; 154016#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153596#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153597#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 154009#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 154010#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 154006#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 154007#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 153537#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 153545#L8 assume { :end_inline_merge } true; 153576#merge_sortFINAL assume true; 153577#merge_sortEXIT >#89#return; 154279#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 154515#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 154513#L12 assume !(merge_~j~0#1 == merge_~n#1); 154511#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 154507#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 154509#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 154605#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 154603#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 154601#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 154599#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 154598#L12 assume !(merge_~j~0#1 == merge_~n#1); 154597#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 154595#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 154593#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 154591#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 154589#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 154587#L12 assume !(merge_~j~0#1 == merge_~n#1); 154586#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 154584#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 154583#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 154582#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 154581#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 154580#L12 assume !(merge_~j~0#1 == merge_~n#1); 154408#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 154405#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 154402#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 154399#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 154396#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 154393#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 154353#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 154356#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 154354#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 153689#L11-4 merge_~i~0#1 := 0; 153688#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153687#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153686#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153685#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153684#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153683#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153682#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 153681#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 153660#L8 assume { :end_inline_merge } true; 153661#merge_sortFINAL assume true; 153648#merge_sortEXIT >#87#return; 153541#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153842#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153841#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); 153566#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153645#$Ultimate##0 [2022-12-13 17:55:04,016 INFO L750 eck$LassoCheckResult]: Loop: 153645#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153652#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); 153568#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153581#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153652#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); 153568#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153581#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153652#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); 153568#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153581#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153652#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); 153568#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153581#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153653#L24 assume ~n#1 < 2; 153827#merge_sortFINAL assume true; 153822#merge_sortEXIT >#87#return; 153773#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153814#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153839#L24 assume ~n#1 < 2; 153815#merge_sortFINAL assume true; 153810#merge_sortEXIT >#89#return; 153809#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 153808#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153807#L12 assume !(merge_~j~0#1 == merge_~n#1); 153806#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 153803#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 153801#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 153799#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 153797#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153795#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153793#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153791#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 153790#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153789#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153788#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 153787#L11-4 merge_~i~0#1 := 0; 153786#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153785#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153784#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153783#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153782#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 153781#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 153780#L8 assume { :end_inline_merge } true; 153778#merge_sortFINAL assume true; 153765#merge_sortEXIT >#87#return; 153702#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153711#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153826#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); 153817#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153824#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153654#L24 assume ~n#1 < 2; 153887#merge_sortFINAL assume true; 153816#merge_sortEXIT >#87#return; 153773#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153814#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153839#L24 assume ~n#1 < 2; 153815#merge_sortFINAL assume true; 153810#merge_sortEXIT >#89#return; 153809#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 153808#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153807#L12 assume !(merge_~j~0#1 == merge_~n#1); 153806#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 153803#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 153801#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 153799#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 153797#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153795#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153793#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153791#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 153790#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153789#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153788#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 153787#L11-4 merge_~i~0#1 := 0; 153786#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153785#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153784#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153783#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153782#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 153781#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 153780#L8 assume { :end_inline_merge } true; 153778#merge_sortFINAL assume true; 153765#merge_sortEXIT >#89#return; 153774#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 155338#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 155336#L12 assume !(merge_~j~0#1 == merge_~n#1); 155334#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 155331#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 155329#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 155327#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 155324#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 155321#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 155319#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 155317#L12 assume !(merge_~j~0#1 == merge_~n#1); 155315#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 155312#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 155310#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 155308#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 155305#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 155302#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 155299#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 155297#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 155296#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 155295#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 155293#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 155290#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 155291#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 155294#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 155292#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 154889#L11-4 merge_~i~0#1 := 0; 154888#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 154887#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 154886#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 154885#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 154884#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 154883#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 154882#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 154881#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 154880#L8 assume { :end_inline_merge } true; 153694#merge_sortFINAL assume true; 153697#merge_sortEXIT >#87#return; 153561#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153659#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153834#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); 153704#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153709#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153837#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); 153823#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153821#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153653#L24 assume ~n#1 < 2; 153827#merge_sortFINAL assume true; 153822#merge_sortEXIT >#87#return; 153773#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153814#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153839#L24 assume ~n#1 < 2; 153815#merge_sortFINAL assume true; 153810#merge_sortEXIT >#89#return; 153809#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 153808#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153807#L12 assume !(merge_~j~0#1 == merge_~n#1); 153806#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 153803#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 153801#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 153799#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 153797#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153795#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153793#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153791#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 153790#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153789#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153788#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 153787#L11-4 merge_~i~0#1 := 0; 153786#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153785#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153784#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153783#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153782#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 153781#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 153780#L8 assume { :end_inline_merge } true; 153778#merge_sortFINAL assume true; 153765#merge_sortEXIT >#87#return; 153702#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153711#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153826#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); 153817#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153824#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153654#L24 assume ~n#1 < 2; 153887#merge_sortFINAL assume true; 153816#merge_sortEXIT >#87#return; 153773#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153814#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153839#L24 assume ~n#1 < 2; 153815#merge_sortFINAL assume true; 153810#merge_sortEXIT >#89#return; 153809#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 153808#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153807#L12 assume !(merge_~j~0#1 == merge_~n#1); 153806#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 153803#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 153801#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 153799#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 153797#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153795#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153793#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 153791#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 153790#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 153789#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 153788#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 153787#L11-4 merge_~i~0#1 := 0; 153786#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153785#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153784#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153783#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153782#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 153781#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 153780#L8 assume { :end_inline_merge } true; 153778#merge_sortFINAL assume true; 153765#merge_sortEXIT >#89#return; 153774#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 155338#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 155336#L12 assume !(merge_~j~0#1 == merge_~n#1); 155334#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 155331#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 155329#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 155327#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 155324#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 155321#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 155319#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 155317#L12 assume !(merge_~j~0#1 == merge_~n#1); 155315#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 155312#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 155310#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 155308#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 155305#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 155302#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 155299#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 155297#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 155296#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 155295#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 155293#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 155290#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 155291#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 155294#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 155292#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 154889#L11-4 merge_~i~0#1 := 0; 154888#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 154887#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 154886#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 154885#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 154884#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 154883#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 154882#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 154881#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 154880#L8 assume { :end_inline_merge } true; 153694#merge_sortFINAL assume true; 153697#merge_sortEXIT >#89#return; 153651#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 155536#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 155533#L12 assume !(merge_~j~0#1 == merge_~n#1); 155530#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 155527#L14 assume !(merge_#t~mem7#1 < merge_#t~mem8#1);merge_#t~post11#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post11#1;call merge_#t~mem12#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post11#1, 4);merge_#t~ite13#1 := merge_#t~mem12#1; 155528#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 155586#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 155585#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 155584#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 155583#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 155582#L12 assume !(merge_~j~0#1 == merge_~n#1); 155579#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 155580#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 155577#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 155573#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 155570#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 155567#L12 assume !(merge_~j~0#1 == merge_~n#1); 155564#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 155562#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 155558#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 155554#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 155549#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 155544#L12 assume !(merge_~j~0#1 == merge_~n#1); 155540#L13 assume merge_~i~0#1 == merge_~m#1;merge_#t~post5#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post5#1;call merge_#t~mem6#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post5#1, 4);merge_#t~ite14#1 := merge_#t~mem6#1; 155537#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 155534#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 155531#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 155402#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 155403#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 155401#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 155405#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 155404#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 153900#L11-4 merge_~i~0#1 := 0; 153898#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153896#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153894#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153883#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153882#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 153693#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 153692#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 153679#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 153680#L8 assume { :end_inline_merge } true; 154816#merge_sortFINAL assume true; 153649#merge_sortEXIT >#87#return; 153565#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 153647#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 153646#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); 153560#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 153645#$Ultimate##0 [2022-12-13 17:55:04,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:55:04,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1140741044, now seen corresponding path program 7 times [2022-12-13 17:55:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:55:04,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849763117] [2022-12-13 17:55:04,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:04,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:55:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:04,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 17:55:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:05,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:05,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:05,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:55:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:05,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:05,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:55:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:05,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 17:55:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:05,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:05,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:55:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:05,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:05,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:55:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 811 proven. 112 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2022-12-13 17:55:05,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:55:05,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849763117] [2022-12-13 17:55:05,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849763117] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:55:05,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984886352] [2022-12-13 17:55:05,615 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 17:55:05,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:55:05,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:55:05,616 INFO L229 MonitoredProcess]: Starting monitored process 300 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:55:05,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (300)] Waiting until timeout for monitored process [2022-12-13 17:55:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:05,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 1401 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 17:55:05,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:55:06,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 537 proven. 219 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2022-12-13 17:55:06,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:55:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 546 proven. 210 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2022-12-13 17:55:06,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984886352] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:55:06,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:55:06,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 33 [2022-12-13 17:55:06,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891570909] [2022-12-13 17:55:06,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:55:06,412 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 17:55:06,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:55:06,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2063099662, now seen corresponding path program 2 times [2022-12-13 17:55:06,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:55:06,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879537307] [2022-12-13 17:55:06,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:06,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:55:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:06,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:55:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 17:55:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:55:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-12-13 17:55:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:55:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 17:55:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:55:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 17:55:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:55:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2254 backedges. 840 proven. 305 refuted. 0 times theorem prover too weak. 1109 trivial. 0 not checked. [2022-12-13 17:55:07,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:55:07,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879537307] [2022-12-13 17:55:07,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879537307] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:55:07,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575571442] [2022-12-13 17:55:07,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:55:07,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 17:55:07,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:55:07,488 INFO L229 MonitoredProcess]: Starting monitored process 301 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 17:55:07,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec8a16ec-f39b-4d4c-80ad-fa6fe4bc4935/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (301)] Waiting until timeout for monitored process [2022-12-13 17:55:07,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:55:07,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:55:07,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 1591 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 17:55:07,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:55:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2254 backedges. 1170 proven. 155 refuted. 0 times theorem prover too weak. 929 trivial. 0 not checked. [2022-12-13 17:55:08,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:55:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2254 backedges. 713 proven. 791 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2022-12-13 17:55:08,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575571442] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 17:55:08,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 17:55:08,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-12-13 17:55:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535765188] [2022-12-13 17:55:08,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 17:55:08,253 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 17:55:08,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:55:08,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 17:55:08,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=914, Unknown=0, NotChecked=0, Total=1056 [2022-12-13 17:55:08,254 INFO L87 Difference]: Start difference. First operand 2856 states and 3319 transitions. cyclomatic complexity: 534 Second operand has 33 states, 31 states have (on average 6.161290322580645) internal successors, (191), 28 states have internal predecessors, (191), 9 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (17), 11 states have call predecessors, (17), 8 states have call successors, (17) [2022-12-13 17:55:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:55:10,293 INFO L93 Difference]: Finished difference Result 3329 states and 3899 transitions. [2022-12-13 17:55:10,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3329 states and 3899 transitions. [2022-12-13 17:55:10,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-12-13 17:55:10,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3329 states to 3287 states and 3857 transitions. [2022-12-13 17:55:10,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 416 [2022-12-13 17:55:10,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 [2022-12-13 17:55:10,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3287 states and 3857 transitions. [2022-12-13 17:55:10,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 17:55:10,312 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3287 states and 3857 transitions. [2022-12-13 17:55:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3287 states and 3857 transitions. [2022-12-13 17:55:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3287 to 2571. [2022-12-13 17:55:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 2503 states have (on average 1.151418298042349) internal successors, (2882), 2500 states have internal predecessors, (2882), 44 states have call successors, (45), 25 states have call predecessors, (45), 24 states have return successors, (106), 45 states have call predecessors, (106), 41 states have call successors, (106) [2022-12-13 17:55:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3033 transitions. [2022-12-13 17:55:10,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2571 states and 3033 transitions. [2022-12-13 17:55:10,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-13 17:55:10,334 INFO L428 stractBuchiCegarLoop]: Abstraction has 2571 states and 3033 transitions. [2022-12-13 17:55:10,334 INFO L335 stractBuchiCegarLoop]: ======== Iteration 41 ============ [2022-12-13 17:55:10,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2571 states and 3033 transitions. [2022-12-13 17:55:10,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-12-13 17:55:10,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 17:55:10,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 17:55:10,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [15, 15, 15, 15, 15, 14, 13, 13, 11, 9, 9, 9, 9, 9, 8, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2022-12-13 17:55:10,340 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 15, 15, 13, 13, 13, 11, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5] [2022-12-13 17:55:10,340 INFO L748 eck$LassoCheckResult]: Stem: 164274#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 164221#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~nondet21#1, main_#t~post20#1, main_~i~1#1, main_~n~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~n~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 164222#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; 164224#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164225#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164226#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164227#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164228#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164303#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164302#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164301#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164300#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164299#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164298#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164297#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164296#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164295#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164294#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164293#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164292#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164291#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164290#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164289#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164288#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164287#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164286#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164285#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164284#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164283#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164282#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164281#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164280#L40-3 assume !!(main_~i~1#1 < main_~n~0#1);call write~int(main_#t~nondet21#1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet21#1; 164279#L40-2 main_#t~post20#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post20#1;havoc main_#t~post20#1; 164278#L40-3 assume !(main_~i~1#1 < main_~n~0#1); 164269#L40-4 call merge_sort(main_~a~0#1.base, main_~a~0#1.offset, main_~n~0#1);< 164270#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164304#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); 164255#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164254#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164256#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); 164206#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164317#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164465#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); 164207#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164317#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164465#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); 164207#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164317#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164467#L24 assume ~n#1 < 2; 164555#merge_sortFINAL assume true; 164552#merge_sortEXIT >#87#return; 164240#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164548#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164557#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); 164239#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164241#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164253#L24 assume ~n#1 < 2; 164266#merge_sortFINAL assume true; 164642#merge_sortEXIT >#87#return; 164263#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164264#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164634#L24 assume ~n#1 < 2; 164633#merge_sortFINAL assume true; 164632#merge_sortEXIT >#89#return; 164631#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 164630#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164629#L12 assume !(merge_~j~0#1 == merge_~n#1); 164628#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 164625#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 164623#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 164621#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 164619#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164617#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164615#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164613#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 164612#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164611#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164610#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 164609#L11-4 merge_~i~0#1 := 0; 164608#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164607#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164606#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164605#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164604#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 164603#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 164602#L8 assume { :end_inline_merge } true; 164601#merge_sortFINAL assume true; 164600#merge_sortEXIT >#89#return; 164599#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 164598#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164597#L12 assume !(merge_~j~0#1 == merge_~n#1); 164596#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 164594#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 164595#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 164593#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 164591#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164589#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164587#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164585#L12 assume !(merge_~j~0#1 == merge_~n#1); 164583#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 164580#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 164581#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 164639#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 164638#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164637#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164636#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164570#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 164571#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164563#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164564#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 164541#L11-4 merge_~i~0#1 := 0; 164536#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164533#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164530#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164525#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164521#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164514#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164513#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 164509#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 164504#L8 assume { :end_inline_merge } true; 164503#merge_sortFINAL assume true; 164499#merge_sortEXIT >#87#return; 164404#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164497#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164556#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); 164397#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164406#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164319#L24 assume ~n#1 < 2; 164455#merge_sortFINAL assume true; 164445#merge_sortEXIT >#87#return; 164393#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164407#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164457#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); 164447#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164453#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164319#L24 assume ~n#1 < 2; 164455#merge_sortFINAL assume true; 164445#merge_sortEXIT >#87#return; 164439#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164441#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164454#L24 assume ~n#1 < 2; 164443#merge_sortFINAL assume true; 164438#merge_sortEXIT >#89#return; 164437#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 164436#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164435#L12 assume !(merge_~j~0#1 == merge_~n#1); 164434#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 164431#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 164429#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 164427#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 164425#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164423#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164421#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164419#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 164418#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164417#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164416#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 164415#L11-4 merge_~i~0#1 := 0; 164414#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164413#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164412#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164411#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164410#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 164409#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 164408#L8 assume { :end_inline_merge } true; 164403#merge_sortFINAL assume true; 164390#merge_sortEXIT >#89#return; 164400#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 164779#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164778#L12 assume !(merge_~j~0#1 == merge_~n#1); 164777#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 164775#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 164776#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 164774#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 164772#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164770#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164768#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164766#L12 assume !(merge_~j~0#1 == merge_~n#1); 164764#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 164761#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 164762#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 164783#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 164782#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164781#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164780#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164750#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 164751#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164744#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164745#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 164741#L11-4 merge_~i~0#1 := 0; 164740#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164739#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164738#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164737#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164735#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164733#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164732#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 164729#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 164727#L8 assume { :end_inline_merge } true; 164725#merge_sortFINAL assume true; 164716#merge_sortEXIT >#89#return; 164237#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 165875#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165874#L12 assume !(merge_~j~0#1 == merge_~n#1); 165873#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 165871#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 165870#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 165869#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 165868#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 165867#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165866#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165865#L12 assume !(merge_~j~0#1 == merge_~n#1); 165864#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 165862#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 165861#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 165860#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 165859#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 165858#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165857#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165856#L12 assume !(merge_~j~0#1 == merge_~n#1); 165855#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 165853#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 165852#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 165851#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 165850#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 165849#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165848#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165844#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 165843#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 165842#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165841#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165838#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 165839#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 165903#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165840#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 164361#L11-4 merge_~i~0#1 := 0; 164360#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164359#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164358#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164357#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164355#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164353#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164352#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 164351#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 164329#L8 assume { :end_inline_merge } true; 164330#merge_sortFINAL assume true; 164313#merge_sortEXIT >#87#return; 164210#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164311#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164312#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); 164243#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164306#$Ultimate##0 [2022-12-13 17:55:10,340 INFO L750 eck$LassoCheckResult]: Loop: 164306#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164318#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); 164242#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164246#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164318#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); 164242#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164246#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164318#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); 164242#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164246#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164320#L24 assume ~n#1 < 2; 164458#merge_sortFINAL assume true; 164451#merge_sortEXIT >#87#return; 164396#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164442#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164456#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); 164447#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164453#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164319#L24 assume ~n#1 < 2; 164455#merge_sortFINAL assume true; 164445#merge_sortEXIT >#87#return; 164439#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164441#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164454#L24 assume ~n#1 < 2; 164443#merge_sortFINAL assume true; 164438#merge_sortEXIT >#89#return; 164437#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 164436#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164435#L12 assume !(merge_~j~0#1 == merge_~n#1); 164434#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 164431#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 164429#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 164427#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 164425#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164423#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164421#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164419#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 164418#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164417#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164416#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 164415#L11-4 merge_~i~0#1 := 0; 164414#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164413#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164412#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164411#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164410#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 164409#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 164408#L8 assume { :end_inline_merge } true; 164403#merge_sortFINAL assume true; 164390#merge_sortEXIT >#89#return; 164399#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 164553#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164550#L12 assume !(merge_~j~0#1 == merge_~n#1); 164544#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 164539#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 164535#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 164532#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 164529#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164524#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164520#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164517#L12 assume !(merge_~j~0#1 == merge_~n#1); 164512#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 164507#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 164508#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 164561#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 164560#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164559#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164558#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164479#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 164480#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164473#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164474#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 164387#L11-4 merge_~i~0#1 := 0; 164386#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164385#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164384#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164383#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164382#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164381#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164380#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 164379#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 164378#L8 assume { :end_inline_merge } true; 164376#merge_sortFINAL assume true; 164367#merge_sortEXIT >#87#return; 164364#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164366#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164493#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); 164391#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164406#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164319#L24 assume ~n#1 < 2; 164455#merge_sortFINAL assume true; 164445#merge_sortEXIT >#87#return; 164392#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164407#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164457#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); 164447#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164453#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164319#L24 assume ~n#1 < 2; 164455#merge_sortFINAL assume true; 164445#merge_sortEXIT >#87#return; 164439#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164441#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164454#L24 assume ~n#1 < 2; 164443#merge_sortFINAL assume true; 164438#merge_sortEXIT >#89#return; 164437#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 164436#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164435#L12 assume !(merge_~j~0#1 == merge_~n#1); 164434#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 164431#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 164429#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 164427#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 164425#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164423#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164421#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164419#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 164418#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164417#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164416#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 164415#L11-4 merge_~i~0#1 := 0; 164414#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164413#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164412#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164411#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164410#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 164409#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 164408#L8 assume { :end_inline_merge } true; 164403#merge_sortFINAL assume true; 164390#merge_sortEXIT >#89#return; 164399#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 164553#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164550#L12 assume !(merge_~j~0#1 == merge_~n#1); 164544#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 164539#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 164535#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 164532#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 164529#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164524#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164520#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164517#L12 assume !(merge_~j~0#1 == merge_~n#1); 164512#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 164507#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 164508#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 164561#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 164560#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164559#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164558#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 164479#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 164480#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 164473#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 164474#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 164387#L11-4 merge_~i~0#1 := 0; 164386#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164385#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164384#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164383#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164382#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164381#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164380#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 164379#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 164378#L8 assume { :end_inline_merge } true; 164376#merge_sortFINAL assume true; 164367#merge_sortEXIT >#89#return; 164373#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~ite15#1, merge_#t~post3#1, merge_#t~mem4#1, merge_#t~ite14#1, merge_#t~post5#1, merge_#t~mem6#1, merge_#t~mem7#1, merge_#t~mem8#1, merge_#t~ite13#1, merge_#t~post9#1, merge_#t~mem10#1, merge_#t~post11#1, merge_#t~mem12#1, merge_#t~post2#1, merge_#t~mem17#1, merge_#t~post16#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; 165660#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165659#L12 assume !(merge_~j~0#1 == merge_~n#1); 165658#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 165656#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 165655#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 165654#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 165653#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 165652#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165651#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165650#L12 assume !(merge_~j~0#1 == merge_~n#1); 165649#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 165647#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 165646#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 165645#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 165644#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 165643#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165642#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165641#L12 assume !(merge_~j~0#1 == merge_~n#1); 165640#L13 assume !(merge_~i~0#1 == merge_~m#1);call merge_#t~mem7#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~j~0#1, 4);call merge_#t~mem8#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4); 165638#L14 assume merge_#t~mem7#1 < merge_#t~mem8#1;merge_#t~post9#1 := merge_~j~0#1;merge_~j~0#1 := 1 + merge_#t~post9#1;call merge_#t~mem10#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post9#1, 4);merge_#t~ite13#1 := merge_#t~mem10#1; 165637#L14-2 merge_#t~ite14#1 := merge_#t~ite13#1; 165636#L13-2 merge_#t~ite15#1 := merge_#t~ite14#1; 165635#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 165634#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165633#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165630#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 165631#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 165812#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165624#L11-3 assume !!(merge_~k~0#1 < merge_~n#1); 165621#L12 assume merge_~j~0#1 == merge_~n#1;merge_#t~post3#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post3#1;call merge_#t~mem4#1 := read~int(merge_~a#1.base, merge_~a#1.offset + 4 * merge_#t~post3#1, 4);merge_#t~ite15#1 := merge_#t~mem4#1; 165622#L12-2 call write~int(merge_#t~ite15#1, merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~k~0#1, 4);havoc merge_#t~ite15#1;havoc merge_#t~post3#1;havoc merge_#t~mem4#1;havoc merge_#t~ite14#1;havoc merge_#t~post5#1;havoc merge_#t~mem6#1;havoc merge_#t~mem7#1;havoc merge_#t~mem8#1;havoc merge_#t~ite13#1;havoc merge_#t~post9#1;havoc merge_#t~mem10#1;havoc merge_#t~post11#1;havoc merge_#t~mem12#1; 165688#L11-2 merge_#t~post2#1 := merge_~k~0#1;merge_~k~0#1 := 1 + merge_#t~post2#1;havoc merge_#t~post2#1; 165623#L11-3 assume !(merge_~k~0#1 < merge_~n#1); 164668#L11-4 merge_~i~0#1 := 0; 164669#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164661#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164662#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164652#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164653#L17-3 assume !!(merge_~i~0#1 < merge_~n#1);call merge_#t~mem17#1 := read~int(merge_~x~0#1.base, merge_~x~0#1.offset + 4 * merge_~i~0#1, 4);call write~int(merge_#t~mem17#1, merge_~a#1.base, merge_~a#1.offset + 4 * merge_~i~0#1, 4);havoc merge_#t~mem17#1; 164347#L17-2 merge_#t~post16#1 := merge_~i~0#1;merge_~i~0#1 := 1 + merge_#t~post16#1;havoc merge_#t~post16#1; 164348#L17-3 assume !(merge_~i~0#1 < merge_~n#1); 164340#L17-4 call ULTIMATE.dealloc(merge_~x~0#1.base, merge_~x~0#1.offset); 164341#L8 assume { :end_inline_merge } true; 164323#merge_sortFINAL assume true; 164326#merge_sortEXIT >#87#return; 164308#L27-1 call merge_sort(~a#1.base, ~a#1.offset + 4 * ~m~0#1, ~n#1 - ~m~0#1);< 164328#$Ultimate##0 ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1; 164307#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); 164244#L27 call merge_sort(~a#1.base, ~a#1.offset, ~m~0#1);< 164306#$Ultimate##0 [2022-12-13 17:55:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:55:10,340 INFO L85 PathProgramCache]: Analyzing trace with hash -861402777, now seen corresponding path program 25 times [2022-12-13 17:55:10,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:55:10,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677255281] [2022-12-13 17:55:10,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:55:10,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:55:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat