/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:50:01,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:50:01,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:50:01,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:50:01,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:50:01,354 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:50:01,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:50:01,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:50:01,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:50:01,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:50:01,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:50:01,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:50:01,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:50:01,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:50:01,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:50:01,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:50:01,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:50:01,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:50:01,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:50:01,391 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:50:01,393 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:50:01,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:50:01,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:50:01,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:50:01,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:50:01,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:50:01,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:50:01,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:50:01,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:50:01,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:50:01,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:50:01,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:50:01,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:50:01,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:50:01,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:50:01,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:50:01,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:50:01,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:50:01,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:50:01,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:50:01,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:50:01,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:50:01,440 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:50:01,489 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:50:01,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:50:01,490 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:50:01,490 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:50:01,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:50:01,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:50:01,493 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:50:01,493 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:50:01,493 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:50:01,494 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:50:01,494 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:50:01,495 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:50:01,495 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:50:01,495 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:50:01,495 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:50:01,495 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:50:01,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:50:01,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:50:01,496 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:50:01,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:50:01,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:50:01,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:50:01,497 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:50:01,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:50:01,498 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:50:01,498 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:50:01,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:50:01,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:50:01,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:50:01,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:50:01,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:50:01,500 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:50:01,502 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:50:01,503 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2022-07-22 12:50:01,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:50:01,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:50:01,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:50:01,934 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:50:01,935 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:50:01,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2022-07-22 12:50:02,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4125581/178d14d05cd84299b2ce0834715dfbe7/FLAGce7ac53e7 [2022-07-22 12:50:02,647 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:50:02,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2022-07-22 12:50:02,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4125581/178d14d05cd84299b2ce0834715dfbe7/FLAGce7ac53e7 [2022-07-22 12:50:02,989 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c4125581/178d14d05cd84299b2ce0834715dfbe7 [2022-07-22 12:50:02,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:50:02,999 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:50:03,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:50:03,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:50:03,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:50:03,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:50:02" (1/1) ... [2022-07-22 12:50:03,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495c03e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:03, skipping insertion in model container [2022-07-22 12:50:03,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:50:02" (1/1) ... [2022-07-22 12:50:03,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:50:03,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:50:03,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c[2434,2447] [2022-07-22 12:50:03,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:50:03,353 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:50:03,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c[2434,2447] [2022-07-22 12:50:03,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:50:03,403 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:50:03,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:03 WrapperNode [2022-07-22 12:50:03,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:50:03,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:50:03,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:50:03,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:50:03,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:03" (1/1) ... [2022-07-22 12:50:03,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:03" (1/1) ... [2022-07-22 12:50:03,459 INFO L137 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-07-22 12:50:03,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:50:03,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:50:03,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:50:03,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:50:03,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:03" (1/1) ... [2022-07-22 12:50:03,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:03" (1/1) ... [2022-07-22 12:50:03,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:03" (1/1) ... [2022-07-22 12:50:03,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:03" (1/1) ... [2022-07-22 12:50:03,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:03" (1/1) ... [2022-07-22 12:50:03,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:03" (1/1) ... [2022-07-22 12:50:03,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:03" (1/1) ... [2022-07-22 12:50:03,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:50:03,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:50:03,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:50:03,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:50:03,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:03" (1/1) ... [2022-07-22 12:50:03,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:03,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:03,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:03,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:50:03,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:50:03,633 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:50:03,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:50:03,633 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:50:03,634 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:50:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 12:50:03,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 12:50:03,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:50:03,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:50:03,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:50:03,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 12:50:03,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:50:03,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:50:03,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:50:03,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:50:03,641 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:50:03,833 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:50:03,836 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:50:04,337 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:50:04,357 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:50:04,357 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:50:04,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:50:04 BoogieIcfgContainer [2022-07-22 12:50:04,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:50:04,362 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:50:04,362 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:50:04,366 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:50:04,367 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:50:04,367 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:50:02" (1/3) ... [2022-07-22 12:50:04,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25411f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:50:04, skipping insertion in model container [2022-07-22 12:50:04,369 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:50:04,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:50:03" (2/3) ... [2022-07-22 12:50:04,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25411f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:50:04, skipping insertion in model container [2022-07-22 12:50:04,369 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:50:04,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:50:04" (3/3) ... [2022-07-22 12:50:04,371 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2022-07-22 12:50:04,519 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-22 12:50:04,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 390 flow [2022-07-22 12:50:04,686 INFO L129 PetriNetUnfolder]: 15/177 cut-off events. [2022-07-22 12:50:04,686 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:50:04,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 177 events. 15/177 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 192 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 131. Up to 2 conditions per place. [2022-07-22 12:50:04,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 183 transitions, 390 flow [2022-07-22 12:50:04,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 177 transitions, 372 flow [2022-07-22 12:50:04,711 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:50:04,722 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 177 transitions, 372 flow [2022-07-22 12:50:04,725 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 177 transitions, 372 flow [2022-07-22 12:50:04,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 172 places, 177 transitions, 372 flow [2022-07-22 12:50:04,804 INFO L129 PetriNetUnfolder]: 15/177 cut-off events. [2022-07-22 12:50:04,804 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-22 12:50:04,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 177 events. 15/177 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 184 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 131. Up to 2 conditions per place. [2022-07-22 12:50:04,814 INFO L116 LiptonReduction]: Number of co-enabled transitions 3534 [2022-07-22 12:50:12,152 INFO L131 LiptonReduction]: Checked pairs total: 4228 [2022-07-22 12:50:12,152 INFO L133 LiptonReduction]: Total number of compositions: 180 [2022-07-22 12:50:12,175 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:50:12,175 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:50:12,175 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:50:12,175 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:50:12,176 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:50:12,176 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:50:12,176 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:50:12,176 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:50:12,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:50:12,295 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 127 [2022-07-22 12:50:12,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:12,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:12,303 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:50:12,303 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:50:12,303 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:50:12,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 170 states, but on-demand construction may add more states [2022-07-22 12:50:12,323 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 127 [2022-07-22 12:50:12,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:12,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:12,324 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2022-07-22 12:50:12,324 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:50:12,330 INFO L748 eck$LassoCheckResult]: Stem: 178#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse2 (store |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1))) (let ((.cse0 (select |v_#memory_int_122| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51| 1))) (and (= v_~sorted1~0_64 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select .cse0 0) 48) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= v_~sorted3~0_82 0) (= (select .cse0 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= v_~A~0.offset_65 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_188| 2) 1) (= (select |v_#valid_188| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= v_~sorted2~0_62 0) (= 25 (select |v_#length_149| 2)) (= (select |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select |v_#length_149| 1) 2) (= |v_#valid_187| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= (select |v_#valid_188| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (store (store (store (store |v_#length_149| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_148|) (= v_~A~0.base_65 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_77) (= |v_#NULL.offset_16| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51|) 0) (= |v_#NULL.base_16| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_51|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_122|, #length=|v_#length_149|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_51|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_37|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_21|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_77, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_65, ~M~0=v_~M~0_49, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_187|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_21|, ~sorted1~0=v_~sorted1~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 181#[L102-6]don't care [2022-07-22 12:50:12,330 INFO L750 eck$LassoCheckResult]: Loop: 181#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 181#[L102-6]don't care [2022-07-22 12:50:12,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:12,337 INFO L85 PathProgramCache]: Analyzing trace with hash 700, now seen corresponding path program 1 times [2022-07-22 12:50:12,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:12,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883919156] [2022-07-22 12:50:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:12,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:12,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:12,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:12,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash 660, now seen corresponding path program 1 times [2022-07-22 12:50:12,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:12,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171750836] [2022-07-22 12:50:12,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:12,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:12,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:12,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:12,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:12,567 INFO L85 PathProgramCache]: Analyzing trace with hash 22329, now seen corresponding path program 1 times [2022-07-22 12:50:12,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:12,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310539859] [2022-07-22 12:50:12,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:12,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:12,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:13,287 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:13,288 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:13,288 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:13,288 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:13,288 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:50:13,289 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:13,289 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:13,289 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:13,289 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration1_Lasso [2022-07-22 12:50:13,289 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:13,290 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:13,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:13,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:14,241 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:50:14,246 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:50:14,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:14,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:14,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 12:50:14,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:14,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:14,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:14,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:14,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:14,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:14,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:14,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:14,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:14,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:14,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:14,316 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:14,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:50:14,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:14,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:14,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:14,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:14,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:14,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:14,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:14,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:14,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:14,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:14,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:14,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:14,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 12:50:14,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:14,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:14,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:14,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:14,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:14,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:14,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:14,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:14,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:14,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:14,453 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:14,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:14,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:14,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:14,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:14,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:14,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:14,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:14,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:14,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 12:50:14,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:14,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:14,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:14,518 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:14,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:14,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:14,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:14,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:14,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:14,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:14,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:14,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:14,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 12:50:14,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:14,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:14,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:14,586 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:14,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 12:50:14,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:14,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:14,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:14,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:14,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:14,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:14,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:14,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:14,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:14,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:14,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:14,631 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:14,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:50:14,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:14,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:14,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:14,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:14,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:14,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:14,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:14,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:14,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:14,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:14,699 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:14,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-07-22 12:50:14,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:14,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:14,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:14,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:14,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:14,718 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:14,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:50:14,734 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:14,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:14,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:14,771 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:14,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:14,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:14,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:14,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:14,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:14,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:14,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:14,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:14,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:50:14,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:14,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:14,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:14,811 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:14,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:50:14,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:14,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:14,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:14,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:14,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:14,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:14,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:14,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:14,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:14,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:14,870 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:14,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:50:14,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-07-22 12:50:14,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:14,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:14,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:14,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:14,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:14,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:14,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:14,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:14,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:14,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:14,911 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:14,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-07-22 12:50:14,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:14,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:14,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:50:14,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:14,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:14,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:14,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:14,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:14,941 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:14,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-22 12:50:14,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:14,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:14,969 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:14,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:50:14,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:14,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:14,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:14,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:14,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:14,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:14,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:14,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:15,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,035 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:50:15,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,049 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:15,050 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,050 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,050 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,051 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:15,051 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:15,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:15,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,100 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:50:15,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:15,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:15,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:15,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-22 12:50:15,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,138 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:50:15,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:15,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:15,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:15,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,196 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:15,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:15,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 12:50:15,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:15,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,269 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:15,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:15,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 12:50:15,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:15,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,334 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 12:50:15,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:15,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:15,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:15,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,394 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 12:50:15,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:15,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:15,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:15,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:15,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,458 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:15,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:15,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 12:50:15,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:15,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,525 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:15,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:15,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:15,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 12:50:15,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:15,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,566 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 12:50:15,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:15,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:15,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:15,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 12:50:15,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,601 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 12:50:15,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:15,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:15,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:15,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:15,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,636 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 12:50:15,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-07-22 12:50:15,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:15,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:15,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:15,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,705 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 12:50:15,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-07-22 12:50:15,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:15,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:15,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:15,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,778 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 12:50:15,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-07-22 12:50:15,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:15,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:15,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 12:50:15,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,818 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 12:50:15,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-07-22 12:50:15,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:15,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:15,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:15,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 12:50:15,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,861 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 12:50:15,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:15,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:15,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:15,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:15,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,898 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 12:50:15,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:15,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:15,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:15,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:15,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-22 12:50:15,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:15,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:15,936 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:15,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 12:50:15,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:15,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:15,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:15,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:15,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:15,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:15,948 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:15,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-22 12:50:16,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,007 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 12:50:16,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:16,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:16,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:16,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:16,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,048 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 12:50:16,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,059 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-22 12:50:16,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,112 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-22 12:50:16,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:16,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,150 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 12:50:16,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:16,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:16,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:16,162 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:16,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,185 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 12:50:16,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-07-22 12:50:16,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,206 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:16,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,230 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 12:50:16,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:16,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:16,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:16,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:16,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,267 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 12:50:16,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:16,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,342 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 12:50:16,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-22 12:50:16,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,424 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 12:50:16,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:16,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,464 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,476 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:16,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:16,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:16,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 12:50:16,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:16,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,504 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 12:50:16,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:16,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:16,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:16,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:16,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,572 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 12:50:16,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-22 12:50:16,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,628 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 12:50:16,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:16,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,667 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-22 12:50:16,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:16,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,714 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-22 12:50:16,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,734 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-22 12:50:16,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,760 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-22 12:50:16,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,773 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,773 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-22 12:50:16,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,833 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,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-07-22 12:50:16,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-22 12:50:16,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,847 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-22 12:50:16,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,875 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-22 12:50: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-07-22 12:50:16,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,888 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:16,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,914 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 12:50:16,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-07-22 12:50:16,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-22 12:50:16,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,956 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 12:50:16,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:16,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:16,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:16,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:16,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:16,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:16,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:16,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:16,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-22 12:50:16,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:16,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:16,996 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:16,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 12:50:16,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:17,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:17,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:17,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:17,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:17,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:17,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:17,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:17,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-22 12:50:17,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:17,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:17,034 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:17,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-22 12:50:17,036 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:17,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:17,045 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:50:17,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:17,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:17,048 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:50:17,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:17,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:17,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-07-22 12:50:17,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:17,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:17,080 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:17,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-22 12:50:17,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:17,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:17,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:17,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:17,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:17,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:17,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:17,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:17,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-22 12:50:17,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:17,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:17,116 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:17,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-22 12:50:17,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:17,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:17,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:17,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:17,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:17,133 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:17,133 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:17,144 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:50:17,228 INFO L443 ModelExtractionUtils]: Simplification made 17 calls to the SMT solver. [2022-07-22 12:50:17,228 INFO L444 ModelExtractionUtils]: 10 out of 22 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-07-22 12:50:17,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:17,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:17,240 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:17,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-22 12:50:17,277 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:50:17,301 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:50:17,302 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:50:17,303 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~i~3#1) = 2*v_rep(select #length ULTIMATE.start_create_fresh_int_array_~arr~0#1.base)_1 - 1*ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset - 4*ULTIMATE.start_create_fresh_int_array_~i~3#1 Supporting invariants [] [2022-07-22 12:50:17,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:17,416 INFO L257 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-07-22 12:50:17,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:17,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:50:17,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:17,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 12:50:17,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:17,526 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:50:17,529 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 170 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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-07-22 12:50:17,579 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 170 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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 172 states and 612 transitions. Complement of second has 3 states. [2022-07-22 12:50:17,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:50:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.0) internal successors, (2), 1 states have internal predecessors, (2), 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-07-22 12:50:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2022-07-22 12:50:17,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 1 letters. [2022-07-22 12:50:17,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:17,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 2 letters. Loop has 1 letters. [2022-07-22 12:50:17,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:17,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 1 letters. Loop has 2 letters. [2022-07-22 12:50:17,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:17,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 172 states and 612 transitions. [2022-07-22 12:50:17,597 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-22 12:50:17,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 172 states to 164 states and 593 transitions. [2022-07-22 12:50:17,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2022-07-22 12:50:17,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2022-07-22 12:50:17,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 593 transitions. [2022-07-22 12:50:17,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:50:17,624 INFO L220 hiAutomatonCegarLoop]: Abstraction has 164 states and 593 transitions. [2022-07-22 12:50:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 593 transitions. [2022-07-22 12:50:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-07-22 12:50:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 164 states have (on average 3.6158536585365852) internal successors, (593), 163 states have internal predecessors, (593), 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-07-22 12:50:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 593 transitions. [2022-07-22 12:50:17,679 INFO L242 hiAutomatonCegarLoop]: Abstraction has 164 states and 593 transitions. [2022-07-22 12:50:17,679 INFO L425 stractBuchiCegarLoop]: Abstraction has 164 states and 593 transitions. [2022-07-22 12:50:17,679 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:50:17,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 593 transitions. [2022-07-22 12:50:17,682 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-22 12:50:17,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:17,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:17,683 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:50:17,683 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:50:17,683 INFO L748 eck$LassoCheckResult]: Stem: 1121#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse2 (store |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1))) (let ((.cse0 (select |v_#memory_int_122| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51| 1))) (and (= v_~sorted1~0_64 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select .cse0 0) 48) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= v_~sorted3~0_82 0) (= (select .cse0 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= v_~A~0.offset_65 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_188| 2) 1) (= (select |v_#valid_188| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= v_~sorted2~0_62 0) (= 25 (select |v_#length_149| 2)) (= (select |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select |v_#length_149| 1) 2) (= |v_#valid_187| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= (select |v_#valid_188| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (store (store (store (store |v_#length_149| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_148|) (= v_~A~0.base_65 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_77) (= |v_#NULL.offset_16| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51|) 0) (= |v_#NULL.base_16| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_51|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_122|, #length=|v_#length_149|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_51|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_37|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_21|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_77, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_65, ~M~0=v_~M~0_49, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_187|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_21|, ~sorted1~0=v_~sorted1~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 995#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_57) (= v_~sorted2~0_50 1) (= |v_ULTIMATE.start_main_#t~pre16#1_31| |v_#pthreadsForks_61|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73| (ite (and (< v_~M~0_41 v_~N~0_67) (<= 0 v_~M~0_41)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (= v_~sorted1~0_56 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_57) (= (+ |v_#pthreadsForks_61| 1) |v_#pthreadsForks_60|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted3~0_70 1) (= (select |v_#valid_171| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_134| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_31|)) |v_#memory_int_112|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_61|, ~M~0=v_~M~0_41, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_113|, #length=|v_#length_134|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_57, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_57, #pthreadsForks=|v_#pthreadsForks_60|, ~M~0=v_~M~0_41, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_112|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_31|, #length=|v_#length_134|, ~sorted1~0=v_~sorted1~0_56, ~sorted2~0=v_~sorted2~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 999#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1087#[thread1ENTRY, L84-4]don't care [421] thread1ENTRY-->L47-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 1063#[L47-5, L84-4]don't care [2022-07-22 12:50:17,684 INFO L750 eck$LassoCheckResult]: Loop: 1063#[L47-5, L84-4]don't care [652] L47-5-->L47-5: Formula: (let ((.cse0 (+ v_thread1Thread1of1ForFork1_~i~0_54 1))) (and (not |v_thread1Thread1of1ForFork1_#t~short4_40|) (= v_thread1Thread1of1ForFork1_~i~0_53 .cse0) (= (mod v_~sorted1~0_49 256) 0) (= v_~sorted1~0_48 (ite (= (ite |v_thread1Thread1of1ForFork1_#t~short4_40| 1 0) 0) 0 1)) (< .cse0 v_~N~0_55))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_54, ~N~0=v_~N~0_55, ~sorted1~0=v_~sorted1~0_49} OutVars{thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_23|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_19|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_39|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_53, ~N~0=v_~N~0_55, ~sorted1~0=v_~sorted1~0_48} AuxVars[|v_thread1Thread1of1ForFork1_#t~short4_40|] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, ~sorted1~0] 1063#[L47-5, L84-4]don't care [2022-07-22 12:50:17,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash 21505276, now seen corresponding path program 1 times [2022-07-22 12:50:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:17,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460288854] [2022-07-22 12:50:17,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:17,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:50:17,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460288854] [2022-07-22 12:50:17,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460288854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:50:17,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:50:17,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:50:17,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531944501] [2022-07-22 12:50:17,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:50:17,833 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:50:17,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:17,833 INFO L85 PathProgramCache]: Analyzing trace with hash 683, now seen corresponding path program 1 times [2022-07-22 12:50:17,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:17,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868062265] [2022-07-22 12:50:17,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:17,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:17,840 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:17,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:17,871 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:17,871 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:17,871 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:17,871 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:17,871 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:50:17,871 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:17,871 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:17,872 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:17,872 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:50:17,872 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:17,872 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:17,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:17,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:17,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:17,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:17,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:17,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:17,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:17,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:17,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:17,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:17,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:17,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,005 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:50:18,006 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:50:18,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:18,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:18,009 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:18,019 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:18,019 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:18,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-22 12:50:18,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:18,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:18,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:18,077 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:18,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:50:18,079 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:18,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-22 12:50:18,324 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:50:18,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:18,327 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:18,328 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:18,328 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:18,328 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:18,328 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:50:18,328 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:18,328 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:18,328 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:18,328 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration2_Loop [2022-07-22 12:50:18,328 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:18,328 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:18,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:18,463 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:50:18,463 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:50:18,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:18,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:18,465 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:18,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:18,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:18,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:18,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:18,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:18,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:18,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:18,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:18,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-22 12:50:18,494 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:50:18,502 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:50:18,502 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:50:18,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:18,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:18,504 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:18,506 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:50:18,507 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:50:18,507 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:50:18,507 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread1Thread1of1ForFork1_~i~0) = 1*~N~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2022-07-22 12:50:18,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-22 12:50:18,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:18,551 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:50:18,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:18,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:50:18,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:18,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:50:18,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:18,607 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:50:18,607 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 593 transitions. cyclomatic complexity: 492 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-07-22 12:50:18,691 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 593 transitions. cyclomatic complexity: 492. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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 331 states and 1359 transitions. Complement of second has 3 states. [2022-07-22 12:50:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:50:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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-07-22 12:50:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 19 transitions. [2022-07-22 12:50:18,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 19 transitions. Stem has 4 letters. Loop has 1 letters. [2022-07-22 12:50:18,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:18,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 19 transitions. Stem has 5 letters. Loop has 1 letters. [2022-07-22 12:50:18,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:18,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 19 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 12:50:18,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:18,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 1359 transitions. [2022-07-22 12:50:18,703 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-22 12:50:18,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 331 states and 1359 transitions. [2022-07-22 12:50:18,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2022-07-22 12:50:18,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 296 [2022-07-22 12:50:18,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331 states and 1359 transitions. [2022-07-22 12:50:18,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:50:18,749 INFO L220 hiAutomatonCegarLoop]: Abstraction has 331 states and 1359 transitions. [2022-07-22 12:50:18,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states and 1359 transitions. [2022-07-22 12:50:18,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 232. [2022-07-22 12:50:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 232 states have (on average 4.1594827586206895) internal successors, (965), 231 states have internal predecessors, (965), 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-07-22 12:50:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 965 transitions. [2022-07-22 12:50:18,785 INFO L242 hiAutomatonCegarLoop]: Abstraction has 232 states and 965 transitions. [2022-07-22 12:50:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:50:18,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:50:18,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:50:18,794 INFO L87 Difference]: Start difference. First operand 232 states and 965 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:18,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:18,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:18,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:50:18,870 INFO L93 Difference]: Finished difference Result 232 states and 964 transitions. [2022-07-22 12:50:18,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 964 transitions. [2022-07-22 12:50:18,876 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-22 12:50:18,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 232 states and 964 transitions. [2022-07-22 12:50:18,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2022-07-22 12:50:18,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2022-07-22 12:50:18,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 232 states and 964 transitions. [2022-07-22 12:50:18,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:50:18,896 INFO L220 hiAutomatonCegarLoop]: Abstraction has 232 states and 964 transitions. [2022-07-22 12:50:18,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states and 964 transitions. [2022-07-22 12:50:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-07-22 12:50:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 232 states have (on average 4.155172413793103) internal successors, (964), 231 states have internal predecessors, (964), 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-07-22 12:50:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 964 transitions. [2022-07-22 12:50:18,929 INFO L242 hiAutomatonCegarLoop]: Abstraction has 232 states and 964 transitions. [2022-07-22 12:50:18,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:50:18,931 INFO L425 stractBuchiCegarLoop]: Abstraction has 232 states and 964 transitions. [2022-07-22 12:50:18,934 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:50:18,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 232 states and 964 transitions. [2022-07-22 12:50:18,938 INFO L131 ngComponentsAnalysis]: Automaton has 62 accepting balls. 126 [2022-07-22 12:50:18,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:18,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:18,938 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:50:18,938 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:50:18,939 INFO L748 eck$LassoCheckResult]: Stem: 2628#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse2 (store |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1))) (let ((.cse0 (select |v_#memory_int_122| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51| 1))) (and (= v_~sorted1~0_64 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select .cse0 0) 48) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= v_~sorted3~0_82 0) (= (select .cse0 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= v_~A~0.offset_65 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_188| 2) 1) (= (select |v_#valid_188| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= v_~sorted2~0_62 0) (= 25 (select |v_#length_149| 2)) (= (select |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select |v_#length_149| 1) 2) (= |v_#valid_187| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= (select |v_#valid_188| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (store (store (store (store |v_#length_149| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_148|) (= v_~A~0.base_65 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_77) (= |v_#NULL.offset_16| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51|) 0) (= |v_#NULL.base_16| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_51|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_122|, #length=|v_#length_149|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_51|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_37|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_21|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_77, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_65, ~M~0=v_~M~0_49, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_187|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_21|, ~sorted1~0=v_~sorted1~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 2402#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 2404#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_57) (= v_~sorted2~0_50 1) (= |v_ULTIMATE.start_main_#t~pre16#1_31| |v_#pthreadsForks_61|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73| (ite (and (< v_~M~0_41 v_~N~0_67) (<= 0 v_~M~0_41)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (= v_~sorted1~0_56 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_57) (= (+ |v_#pthreadsForks_61| 1) |v_#pthreadsForks_60|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted3~0_70 1) (= (select |v_#valid_171| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_134| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_31|)) |v_#memory_int_112|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_61|, ~M~0=v_~M~0_41, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_113|, #length=|v_#length_134|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_57, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_57, #pthreadsForks=|v_#pthreadsForks_60|, ~M~0=v_~M~0_41, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_112|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_31|, #length=|v_#length_134|, ~sorted1~0=v_~sorted1~0_56, ~sorted2~0=v_~sorted2~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2406#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 2532#[thread1ENTRY, L84-4]don't care [421] thread1ENTRY-->L47-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 2534#[L47-5, L84-4]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_31 4))) (let ((.cse1 (+ v_~A~0.offset_27 .cse0))) (and |v_thread1Thread1of1ForFork1_#t~short4_25| (<= (+ v_~A~0.offset_27 .cse0 4) (select |v_#length_66| v_~A~0.base_27)) (= (select (select |v_#memory_int_52| v_~A~0.base_27) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_15|) (<= 0 .cse1) (= (select |v_#valid_83| v_~A~0.base_27) 1) (not (= (mod v_~sorted1~0_24 256) 0)) (< (+ v_thread1Thread1of1ForFork1_~i~0_31 1) v_~N~0_29)))) InVars {~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 2492#[L84-4, L48-3]don't care [2022-07-22 12:50:18,940 INFO L750 eck$LassoCheckResult]: Loop: 2492#[L84-4, L48-3]don't care [651] L48-3-->L47-5: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_50 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_45 4))) (and (= v_~sorted1~0_46 (ite (= (ite |v_thread1Thread1of1ForFork1_#t~short4_36| 1 0) 0) 0 1)) (<= (+ .cse0 v_~A~0.offset_45 8) (select |v_#length_122| v_~A~0.base_45)) (<= 0 .cse1) (let ((.cse2 (< |v_thread1Thread1of1ForFork1_#t~mem2_26| (select (select |v_#memory_int_102| v_~A~0.base_45) .cse1)))) (or (and .cse2 |v_thread1Thread1of1ForFork1_#t~short4_36|) (and (not .cse2) (not |v_thread1Thread1of1ForFork1_#t~short4_36|)))) (= (select |v_#valid_159| v_~A~0.base_45) 1) (= v_thread1Thread1of1ForFork1_~i~0_49 (+ v_thread1Thread1of1ForFork1_~i~0_50 1))))) InVars {~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_26|, #valid=|v_#valid_159|, #memory_int=|v_#memory_int_102|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_50, #length=|v_#length_122|} OutVars{~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_21|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_35|, #valid=|v_#valid_159|, #memory_int=|v_#memory_int_102|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, #length=|v_#length_122|, ~sorted1~0=v_~sorted1~0_46} AuxVars[|v_thread1Thread1of1ForFork1_#t~short4_36|] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, ~sorted1~0] 2490#[L47-5, L84-4]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_31 4))) (let ((.cse1 (+ v_~A~0.offset_27 .cse0))) (and |v_thread1Thread1of1ForFork1_#t~short4_25| (<= (+ v_~A~0.offset_27 .cse0 4) (select |v_#length_66| v_~A~0.base_27)) (= (select (select |v_#memory_int_52| v_~A~0.base_27) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_15|) (<= 0 .cse1) (= (select |v_#valid_83| v_~A~0.base_27) 1) (not (= (mod v_~sorted1~0_24 256) 0)) (< (+ v_thread1Thread1of1ForFork1_~i~0_31 1) v_~N~0_29)))) InVars {~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 2492#[L84-4, L48-3]don't care [2022-07-22 12:50:18,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:18,940 INFO L85 PathProgramCache]: Analyzing trace with hash -833336635, now seen corresponding path program 1 times [2022-07-22 12:50:18,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:18,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353277439] [2022-07-22 12:50:18,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:18,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:19,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:50:19,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353277439] [2022-07-22 12:50:19,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353277439] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:50:19,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33561730] [2022-07-22 12:50:19,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:19,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:50:19,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:19,088 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:50:19,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-07-22 12:50:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:19,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 12:50:19,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:19,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:50:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:19,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33561730] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:50:19,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:50:19,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-07-22 12:50:19,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728343940] [2022-07-22 12:50:19,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:50:19,275 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:50:19,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash 21722, now seen corresponding path program 1 times [2022-07-22 12:50:19,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:19,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497214484] [2022-07-22 12:50:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:19,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:19,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:19,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:50:19,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 12:50:19,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-22 12:50:19,431 INFO L87 Difference]: Start difference. First operand 232 states and 964 transitions. cyclomatic complexity: 829 Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:50:19,626 INFO L93 Difference]: Finished difference Result 393 states and 1482 transitions. [2022-07-22 12:50:19,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 393 states and 1482 transitions. [2022-07-22 12:50:19,634 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 204 [2022-07-22 12:50:19,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 393 states to 387 states and 1465 transitions. [2022-07-22 12:50:19,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 351 [2022-07-22 12:50:19,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 351 [2022-07-22 12:50:19,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 387 states and 1465 transitions. [2022-07-22 12:50:19,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:50:19,644 INFO L220 hiAutomatonCegarLoop]: Abstraction has 387 states and 1465 transitions. [2022-07-22 12:50:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states and 1465 transitions. [2022-07-22 12:50:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 298. [2022-07-22 12:50:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 298 states have (on average 4.003355704697986) internal successors, (1193), 297 states have internal predecessors, (1193), 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-07-22 12:50:19,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 1193 transitions. [2022-07-22 12:50:19,658 INFO L242 hiAutomatonCegarLoop]: Abstraction has 298 states and 1193 transitions. [2022-07-22 12:50:19,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:50:19,659 INFO L425 stractBuchiCegarLoop]: Abstraction has 298 states and 1193 transitions. [2022-07-22 12:50:19,659 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:50:19,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 298 states and 1193 transitions. [2022-07-22 12:50:19,664 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 166 [2022-07-22 12:50:19,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:19,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:19,664 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2022-07-22 12:50:19,664 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:50:19,665 INFO L748 eck$LassoCheckResult]: Stem: 3544#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse2 (store |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1))) (let ((.cse0 (select |v_#memory_int_122| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51| 1))) (and (= v_~sorted1~0_64 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select .cse0 0) 48) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= v_~sorted3~0_82 0) (= (select .cse0 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= v_~A~0.offset_65 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_188| 2) 1) (= (select |v_#valid_188| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= v_~sorted2~0_62 0) (= 25 (select |v_#length_149| 2)) (= (select |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select |v_#length_149| 1) 2) (= |v_#valid_187| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= (select |v_#valid_188| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (store (store (store (store |v_#length_149| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_148|) (= v_~A~0.base_65 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_77) (= |v_#NULL.offset_16| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51|) 0) (= |v_#NULL.base_16| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_51|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_122|, #length=|v_#length_149|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_51|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_37|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_21|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_77, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_65, ~M~0=v_~M~0_49, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_187|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_21|, ~sorted1~0=v_~sorted1~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 3332#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 3334#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 3336#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_57) (= v_~sorted2~0_50 1) (= |v_ULTIMATE.start_main_#t~pre16#1_31| |v_#pthreadsForks_61|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73| (ite (and (< v_~M~0_41 v_~N~0_67) (<= 0 v_~M~0_41)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (= v_~sorted1~0_56 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_57) (= (+ |v_#pthreadsForks_61| 1) |v_#pthreadsForks_60|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted3~0_70 1) (= (select |v_#valid_171| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_134| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_31|)) |v_#memory_int_112|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_61|, ~M~0=v_~M~0_41, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_113|, #length=|v_#length_134|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_57, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_57, #pthreadsForks=|v_#pthreadsForks_60|, ~M~0=v_~M~0_41, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_112|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_31|, #length=|v_#length_134|, ~sorted1~0=v_~sorted1~0_56, ~sorted2~0=v_~sorted2~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 3584#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 3576#[thread1ENTRY, L84-4]don't care [421] thread1ENTRY-->L47-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 3578#[L47-5, L84-4]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_31 4))) (let ((.cse1 (+ v_~A~0.offset_27 .cse0))) (and |v_thread1Thread1of1ForFork1_#t~short4_25| (<= (+ v_~A~0.offset_27 .cse0 4) (select |v_#length_66| v_~A~0.base_27)) (= (select (select |v_#memory_int_52| v_~A~0.base_27) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_15|) (<= 0 .cse1) (= (select |v_#valid_83| v_~A~0.base_27) 1) (not (= (mod v_~sorted1~0_24 256) 0)) (< (+ v_thread1Thread1of1ForFork1_~i~0_31 1) v_~N~0_29)))) InVars {~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 3436#[L84-4, L48-3]don't care [2022-07-22 12:50:19,666 INFO L750 eck$LassoCheckResult]: Loop: 3436#[L84-4, L48-3]don't care [651] L48-3-->L47-5: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_50 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_45 4))) (and (= v_~sorted1~0_46 (ite (= (ite |v_thread1Thread1of1ForFork1_#t~short4_36| 1 0) 0) 0 1)) (<= (+ .cse0 v_~A~0.offset_45 8) (select |v_#length_122| v_~A~0.base_45)) (<= 0 .cse1) (let ((.cse2 (< |v_thread1Thread1of1ForFork1_#t~mem2_26| (select (select |v_#memory_int_102| v_~A~0.base_45) .cse1)))) (or (and .cse2 |v_thread1Thread1of1ForFork1_#t~short4_36|) (and (not .cse2) (not |v_thread1Thread1of1ForFork1_#t~short4_36|)))) (= (select |v_#valid_159| v_~A~0.base_45) 1) (= v_thread1Thread1of1ForFork1_~i~0_49 (+ v_thread1Thread1of1ForFork1_~i~0_50 1))))) InVars {~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_26|, #valid=|v_#valid_159|, #memory_int=|v_#memory_int_102|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_50, #length=|v_#length_122|} OutVars{~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_21|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_35|, #valid=|v_#valid_159|, #memory_int=|v_#memory_int_102|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, #length=|v_#length_122|, ~sorted1~0=v_~sorted1~0_46} AuxVars[|v_thread1Thread1of1ForFork1_#t~short4_36|] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, ~sorted1~0] 3530#[L47-5, L84-4]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_31 4))) (let ((.cse1 (+ v_~A~0.offset_27 .cse0))) (and |v_thread1Thread1of1ForFork1_#t~short4_25| (<= (+ v_~A~0.offset_27 .cse0 4) (select |v_#length_66| v_~A~0.base_27)) (= (select (select |v_#memory_int_52| v_~A~0.base_27) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_15|) (<= 0 .cse1) (= (select |v_#valid_83| v_~A~0.base_27) 1) (not (= (mod v_~sorted1~0_24 256) 0)) (< (+ v_thread1Thread1of1ForFork1_~i~0_31 1) v_~N~0_29)))) InVars {~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 3436#[L84-4, L48-3]don't care [2022-07-22 12:50:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:19,666 INFO L85 PathProgramCache]: Analyzing trace with hash -88720280, now seen corresponding path program 2 times [2022-07-22 12:50:19,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:19,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673061303] [2022-07-22 12:50:19,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:19,708 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:19,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:19,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash 21722, now seen corresponding path program 2 times [2022-07-22 12:50:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:19,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585118934] [2022-07-22 12:50:19,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:19,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:19,761 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:19,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:19,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:19,779 INFO L85 PathProgramCache]: Analyzing trace with hash 639177601, now seen corresponding path program 1 times [2022-07-22 12:50:19,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:19,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576336625] [2022-07-22 12:50:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:19,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:19,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:50:19,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576336625] [2022-07-22 12:50:19,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576336625] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:50:19,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424588089] [2022-07-22 12:50:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:19,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:50:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:19,913 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:50:19,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-07-22 12:50:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:19,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 12:50:19,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:20,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:50:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:20,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424588089] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:50:20,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:50:20,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-07-22 12:50:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718227286] [2022-07-22 12:50:20,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:50:20,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:50:20,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 12:50:20,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-22 12:50:20,290 INFO L87 Difference]: Start difference. First operand 298 states and 1193 transitions. cyclomatic complexity: 1016 Second operand has 17 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 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-07-22 12:50:20,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:50:20,798 INFO L93 Difference]: Finished difference Result 677 states and 2523 transitions. [2022-07-22 12:50:20,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 677 states and 2523 transitions. [2022-07-22 12:50:20,811 INFO L131 ngComponentsAnalysis]: Automaton has 206 accepting balls. 360 [2022-07-22 12:50:20,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 677 states to 665 states and 2481 transitions. [2022-07-22 12:50:20,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 596 [2022-07-22 12:50:20,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 628 [2022-07-22 12:50:20,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 665 states and 2481 transitions. [2022-07-22 12:50:20,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:50:20,829 INFO L220 hiAutomatonCegarLoop]: Abstraction has 665 states and 2481 transitions. [2022-07-22 12:50:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states and 2481 transitions. [2022-07-22 12:50:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 396. [2022-07-22 12:50:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 396 states have (on average 4.037878787878788) internal successors, (1599), 395 states have internal predecessors, (1599), 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-07-22 12:50:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1599 transitions. [2022-07-22 12:50:20,850 INFO L242 hiAutomatonCegarLoop]: Abstraction has 396 states and 1599 transitions. [2022-07-22 12:50:20,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 12:50:20,852 INFO L425 stractBuchiCegarLoop]: Abstraction has 396 states and 1599 transitions. [2022-07-22 12:50:20,852 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:50:20,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 396 states and 1599 transitions. [2022-07-22 12:50:20,857 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 226 [2022-07-22 12:50:20,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:20,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:20,858 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:50:20,858 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:50:20,859 INFO L748 eck$LassoCheckResult]: Stem: 4963#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse2 (store |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1))) (let ((.cse0 (select |v_#memory_int_122| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51| 1))) (and (= v_~sorted1~0_64 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select .cse0 0) 48) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= v_~sorted3~0_82 0) (= (select .cse0 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= v_~A~0.offset_65 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_188| 2) 1) (= (select |v_#valid_188| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= v_~sorted2~0_62 0) (= 25 (select |v_#length_149| 2)) (= (select |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select |v_#length_149| 1) 2) (= |v_#valid_187| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= (select |v_#valid_188| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (store (store (store (store |v_#length_149| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_148|) (= v_~A~0.base_65 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_77) (= |v_#NULL.offset_16| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51|) 0) (= |v_#NULL.base_16| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_51|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_122|, #length=|v_#length_149|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_51|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_37|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_21|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_77, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_65, ~M~0=v_~M~0_49, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_187|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_21|, ~sorted1~0=v_~sorted1~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 4695#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 4697#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_57) (= v_~sorted2~0_50 1) (= |v_ULTIMATE.start_main_#t~pre16#1_31| |v_#pthreadsForks_61|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73| (ite (and (< v_~M~0_41 v_~N~0_67) (<= 0 v_~M~0_41)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (= v_~sorted1~0_56 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_57) (= (+ |v_#pthreadsForks_61| 1) |v_#pthreadsForks_60|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted3~0_70 1) (= (select |v_#valid_171| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_134| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_31|)) |v_#memory_int_112|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_61|, ~M~0=v_~M~0_41, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_113|, #length=|v_#length_134|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_57, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_57, #pthreadsForks=|v_#pthreadsForks_60|, ~M~0=v_~M~0_41, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_112|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_31|, #length=|v_#length_134|, ~sorted1~0=v_~sorted1~0_56, ~sorted2~0=v_~sorted2~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 4701#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 4849#[thread1ENTRY, L84-4]don't care [613] L84-4-->L85-3: Formula: (and (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_15| |v_#pthreadsForks_37|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_19|) (= (select |v_#valid_115| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) 1) (= (store |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre18#1_15|)) |v_#memory_int_64|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_19| 4) (select |v_#length_86| |v_ULTIMATE.start_main_~#t2~0#1.base_21|))) InVars {#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_65|, #length=|v_#length_86|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_64|, #length=|v_#length_86|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 4851#[thread1ENTRY, L85-3]don't care [486] L85-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre18#1_6| v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_8|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_8|, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_16, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_4|, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_14|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_#t~post5=|v_thread2Thread1of1ForFork2_#t~post5_8|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_#t~mem7, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#t~short8, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_#t~post5, thread2Thread1of1ForFork2_#res.offset] 4649#[thread1ENTRY, thread2ENTRY, L85-4]don't care [440] thread2ENTRY-->L55-5: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] 4655#[L55-5, thread1ENTRY, L85-4]don't care [2022-07-22 12:50:20,859 INFO L750 eck$LassoCheckResult]: Loop: 4655#[L55-5, thread1ENTRY, L85-4]don't care [664] L55-5-->L55-5: Formula: (and (= (mod v_~sorted2~0_55 256) 0) (< v_thread2Thread1of1ForFork2_~i~1_52 v_~M~0_43) (not |v_thread2Thread1of1ForFork2_#t~short8_42|) (= v_~sorted2~0_54 (ite (= 0 (ite |v_thread2Thread1of1ForFork2_#t~short8_42| 1 0)) 0 1)) (= (+ v_thread2Thread1of1ForFork2_~i~1_52 1) v_thread2Thread1of1ForFork2_~i~1_51)) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_52, ~M~0=v_~M~0_43, ~sorted2~0=v_~sorted2~0_55} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_33|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_27|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_51, ~M~0=v_~M~0_43, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_41|, thread2Thread1of1ForFork2_#t~post5=|v_thread2Thread1of1ForFork2_#t~post5_21|, ~sorted2~0=v_~sorted2~0_54} AuxVars[|v_thread2Thread1of1ForFork2_#t~short8_42|] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_#t~mem7, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~short8, thread2Thread1of1ForFork2_#t~post5, ~sorted2~0] 4655#[L55-5, thread1ENTRY, L85-4]don't care [2022-07-22 12:50:20,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:20,860 INFO L85 PathProgramCache]: Analyzing trace with hash -63449871, now seen corresponding path program 1 times [2022-07-22 12:50:20,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:20,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57214248] [2022-07-22 12:50:20,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:20,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:20,899 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:20,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:20,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:20,924 INFO L85 PathProgramCache]: Analyzing trace with hash 695, now seen corresponding path program 1 times [2022-07-22 12:50:20,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:20,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554900373] [2022-07-22 12:50:20,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:20,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:20,929 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:20,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:20,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1966945337, now seen corresponding path program 1 times [2022-07-22 12:50:20,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:20,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132540693] [2022-07-22 12:50:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 12:50:20,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:50:20,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132540693] [2022-07-22 12:50:20,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132540693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:50:20,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:50:20,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:50:20,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392986501] [2022-07-22 12:50:20,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:50:20,987 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:20,988 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:20,988 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:20,988 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:20,988 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:50:20,988 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:20,988 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:20,988 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:20,988 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:50:20,988 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:20,989 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:20,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:20,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:20,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:20,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:21,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:21,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:21,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:21,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:21,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:21,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:21,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:21,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:21,113 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:50:21,114 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:50:21,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:21,115 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:21,130 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:21,130 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:21,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-22 12:50:21,151 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:21,151 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_4=-1} Honda state: {v_rep#funAddr~thread1.base_4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:21,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:21,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:21,186 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:21,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:21,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:21,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-22 12:50:21,208 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:21,208 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.base_4=-1} Honda state: {v_rep#funAddr~thread3.base_4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:21,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:21,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:21,252 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:21,254 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:21,254 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:21,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-22 12:50:21,276 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:21,276 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_4=-1} Honda state: {v_rep#funAddr~thread2.base_4=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:21,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:21,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:21,319 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:21,321 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:21,321 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:21,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-22 12:50:21,344 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:21,345 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~sorted2~0=0} Honda state: {~sorted2~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:21,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:21,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:21,388 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:21,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:21,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:21,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-22 12:50:21,412 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:21,412 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork2_#t~mem7=0} Honda state: {thread2Thread1of1ForFork2_#t~mem7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:21,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:21,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:21,457 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:21,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:21,459 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:21,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-22 12:50:21,479 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:21,479 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_4=0} Honda state: {v_rep#funAddr~thread1.offset_4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:21,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:21,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:21,517 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:21,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:21,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:21,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-22 12:50:21,540 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:21,540 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite thread2Thread1of1ForFork2_#t~short8 1 0)_1=0} Honda state: {v_rep(ite thread2Thread1of1ForFork2_#t~short8 1 0)_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:21,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:21,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:21,582 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:21,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:21,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:21,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-22 12:50:21,606 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:21,607 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork2_#t~post5=0} Honda state: {thread2Thread1of1ForFork2_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:21,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:21,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:21,648 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:21,651 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:21,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:21,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-22 12:50:21,672 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:21,672 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_4=1} Honda state: {v_rep#funAddr~thread2.offset_4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:21,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:21,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:21,708 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:21,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:21,711 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:21,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-22 12:50:21,729 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:21,730 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork2_#t~mem6=0} Honda state: {thread2Thread1of1ForFork2_#t~mem6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:21,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-07-22 12:50:21,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:21,766 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:21,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-22 12:50:21,767 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:21,767 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:21,781 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:21,781 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.offset_4=2} Honda state: {v_rep#funAddr~thread3.offset_4=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:21,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-22 12:50:21,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:21,804 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:21,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:21,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:21,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-22 12:50:21,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-22 12:50:21,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:21,847 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:21,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-22 12:50:21,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:50:21,848 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:21,996 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:50:21,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-22 12:50:21,999 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:21,999 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:21,999 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:21,999 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:21,999 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:50:21,999 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:21,999 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:21,999 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:21,999 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration5_Loop [2022-07-22 12:50:21,999 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:21,999 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:22,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:22,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:22,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:22,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:22,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:22,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:22,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:22,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:22,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:22,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:22,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:22,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:22,127 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:50:22,128 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:50:22,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:22,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:22,129 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:22,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:22,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:22,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:22,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:22,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:22,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:22,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:22,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-22 12:50:22,161 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:22,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:22,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:22,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:22,197 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:22,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:22,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:22,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:22,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:22,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:22,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:22,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:22,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-22 12:50:22,220 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:22,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2022-07-22 12:50:22,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:22,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:22,244 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:22,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-22 12:50:22,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-07-22 12:50:22,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:22,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:22,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:22,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:22,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:22,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:22,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:22,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:22,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:22,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:22,315 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:22,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:22,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:22,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:22,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:22,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:22,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:22,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:22,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:22,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-22 12:50:22,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:22,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:22,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:22,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:22,374 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:22,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:22,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-22 12:50:22,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:22,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:22,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:22,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:22,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:22,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:22,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:22,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:22,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:22,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:22,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:22,426 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:22,427 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:22,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-22 12:50:22,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:22,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:22,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:22,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:22,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:22,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:22,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:22,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-07-22 12:50:22,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:22,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:22,475 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:22,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-22 12:50:22,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:22,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:22,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:22,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:22,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:22,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:22,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:22,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:22,488 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:22,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-07-22 12:50:22,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:22,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:22,511 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:22,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:22,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-22 12:50:22,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:22,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:22,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:22,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:22,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:22,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:22,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:22,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-07-22 12:50:22,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:22,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:22,564 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:22,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-22 12:50:22,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:22,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:22,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:22,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:22,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:22,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:22,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:22,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:22,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:22,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:22,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:22,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:22,598 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:22,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:22,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-22 12:50:22,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:22,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:22,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:22,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:22,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:22,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:22,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:22,613 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:50:22,635 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 12:50:22,636 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 12:50:22,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:22,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:22,645 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:22,656 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:50:22,656 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:50:22,656 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:50:22,656 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork2_~i~1, ~M~0) = -1*thread2Thread1of1ForFork2_~i~1 + 1*~M~0 Supporting invariants [] [2022-07-22 12:50:22,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-22 12:50:22,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-07-22 12:50:22,686 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:50:22,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:22,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:50:22,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:22,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:50:22,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:22,750 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:50:22,750 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 396 states and 1599 transitions. cyclomatic complexity: 1360 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:22,847 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 396 states and 1599 transitions. cyclomatic complexity: 1360. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 777 states and 3380 transitions. Complement of second has 3 states. [2022-07-22 12:50:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:50:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2022-07-22 12:50:22,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 21 transitions. Stem has 7 letters. Loop has 1 letters. [2022-07-22 12:50:22,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:22,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 21 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:50:22,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:22,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 21 transitions. Stem has 7 letters. Loop has 2 letters. [2022-07-22 12:50:22,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:22,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 777 states and 3380 transitions. [2022-07-22 12:50:22,868 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 226 [2022-07-22 12:50:22,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 777 states to 777 states and 3380 transitions. [2022-07-22 12:50:22,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 437 [2022-07-22 12:50:22,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 654 [2022-07-22 12:50:22,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 777 states and 3380 transitions. [2022-07-22 12:50:22,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:50:22,891 INFO L220 hiAutomatonCegarLoop]: Abstraction has 777 states and 3380 transitions. [2022-07-22 12:50:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states and 3380 transitions. [2022-07-22 12:50:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 552. [2022-07-22 12:50:22,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 552 states have (on average 4.443840579710145) internal successors, (2453), 551 states have internal predecessors, (2453), 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-07-22 12:50:22,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 2453 transitions. [2022-07-22 12:50:22,917 INFO L242 hiAutomatonCegarLoop]: Abstraction has 552 states and 2453 transitions. [2022-07-22 12:50:22,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:50:22,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:50:22,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:50:22,918 INFO L87 Difference]: Start difference. First operand 552 states and 2453 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:50:22,987 INFO L93 Difference]: Finished difference Result 742 states and 2995 transitions. [2022-07-22 12:50:22,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 742 states and 2995 transitions. [2022-07-22 12:50:23,007 INFO L131 ngComponentsAnalysis]: Automaton has 196 accepting balls. 324 [2022-07-22 12:50:23,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 742 states to 742 states and 2995 transitions. [2022-07-22 12:50:23,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 681 [2022-07-22 12:50:23,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 681 [2022-07-22 12:50:23,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 742 states and 2995 transitions. [2022-07-22 12:50:23,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:50:23,025 INFO L220 hiAutomatonCegarLoop]: Abstraction has 742 states and 2995 transitions. [2022-07-22 12:50:23,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states and 2995 transitions. [2022-07-22 12:50:23,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 496. [2022-07-22 12:50:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 496 states have (on average 4.183467741935484) internal successors, (2075), 495 states have internal predecessors, (2075), 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-07-22 12:50:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 2075 transitions. [2022-07-22 12:50:23,051 INFO L242 hiAutomatonCegarLoop]: Abstraction has 496 states and 2075 transitions. [2022-07-22 12:50:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:50:23,054 INFO L425 stractBuchiCegarLoop]: Abstraction has 496 states and 2075 transitions. [2022-07-22 12:50:23,054 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 12:50:23,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 496 states and 2075 transitions. [2022-07-22 12:50:23,061 INFO L131 ngComponentsAnalysis]: Automaton has 146 accepting balls. 258 [2022-07-22 12:50:23,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:23,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:23,062 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1] [2022-07-22 12:50:23,062 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:50:23,063 INFO L748 eck$LassoCheckResult]: Stem: 8541#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse2 (store |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1))) (let ((.cse0 (select |v_#memory_int_122| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51| 1))) (and (= v_~sorted1~0_64 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select .cse0 0) 48) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= v_~sorted3~0_82 0) (= (select .cse0 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= v_~A~0.offset_65 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_188| 2) 1) (= (select |v_#valid_188| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= v_~sorted2~0_62 0) (= 25 (select |v_#length_149| 2)) (= (select |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select |v_#length_149| 1) 2) (= |v_#valid_187| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= (select |v_#valid_188| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (store (store (store (store |v_#length_149| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_148|) (= v_~A~0.base_65 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_77) (= |v_#NULL.offset_16| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51|) 0) (= |v_#NULL.base_16| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_51|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_122|, #length=|v_#length_149|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_51|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_37|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_21|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_77, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_65, ~M~0=v_~M~0_49, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_187|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_21|, ~sorted1~0=v_~sorted1~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 8161#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 8163#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 8165#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 8613#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_57) (= v_~sorted2~0_50 1) (= |v_ULTIMATE.start_main_#t~pre16#1_31| |v_#pthreadsForks_61|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73| (ite (and (< v_~M~0_41 v_~N~0_67) (<= 0 v_~M~0_41)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (= v_~sorted1~0_56 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_57) (= (+ |v_#pthreadsForks_61| 1) |v_#pthreadsForks_60|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted3~0_70 1) (= (select |v_#valid_171| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_134| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_31|)) |v_#memory_int_112|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_61|, ~M~0=v_~M~0_41, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_113|, #length=|v_#length_134|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_57, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_57, #pthreadsForks=|v_#pthreadsForks_60|, ~M~0=v_~M~0_41, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_112|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_31|, #length=|v_#length_134|, ~sorted1~0=v_~sorted1~0_56, ~sorted2~0=v_~sorted2~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 8611#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 8565#[thread1ENTRY, L84-4]don't care [421] thread1ENTRY-->L47-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 8563#[L47-5, L84-4]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_31 4))) (let ((.cse1 (+ v_~A~0.offset_27 .cse0))) (and |v_thread1Thread1of1ForFork1_#t~short4_25| (<= (+ v_~A~0.offset_27 .cse0 4) (select |v_#length_66| v_~A~0.base_27)) (= (select (select |v_#memory_int_52| v_~A~0.base_27) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_15|) (<= 0 .cse1) (= (select |v_#valid_83| v_~A~0.base_27) 1) (not (= (mod v_~sorted1~0_24 256) 0)) (< (+ v_thread1Thread1of1ForFork1_~i~0_31 1) v_~N~0_29)))) InVars {~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 8311#[L84-4, L48-3]don't care [2022-07-22 12:50:23,063 INFO L750 eck$LassoCheckResult]: Loop: 8311#[L84-4, L48-3]don't care [651] L48-3-->L47-5: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_50 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_45 4))) (and (= v_~sorted1~0_46 (ite (= (ite |v_thread1Thread1of1ForFork1_#t~short4_36| 1 0) 0) 0 1)) (<= (+ .cse0 v_~A~0.offset_45 8) (select |v_#length_122| v_~A~0.base_45)) (<= 0 .cse1) (let ((.cse2 (< |v_thread1Thread1of1ForFork1_#t~mem2_26| (select (select |v_#memory_int_102| v_~A~0.base_45) .cse1)))) (or (and .cse2 |v_thread1Thread1of1ForFork1_#t~short4_36|) (and (not .cse2) (not |v_thread1Thread1of1ForFork1_#t~short4_36|)))) (= (select |v_#valid_159| v_~A~0.base_45) 1) (= v_thread1Thread1of1ForFork1_~i~0_49 (+ v_thread1Thread1of1ForFork1_~i~0_50 1))))) InVars {~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_26|, #valid=|v_#valid_159|, #memory_int=|v_#memory_int_102|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_50, #length=|v_#length_122|} OutVars{~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_21|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_35|, #valid=|v_#valid_159|, #memory_int=|v_#memory_int_102|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, #length=|v_#length_122|, ~sorted1~0=v_~sorted1~0_46} AuxVars[|v_thread1Thread1of1ForFork1_#t~short4_36|] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, ~sorted1~0] 8491#[L47-5, L84-4]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_31 4))) (let ((.cse1 (+ v_~A~0.offset_27 .cse0))) (and |v_thread1Thread1of1ForFork1_#t~short4_25| (<= (+ v_~A~0.offset_27 .cse0 4) (select |v_#length_66| v_~A~0.base_27)) (= (select (select |v_#memory_int_52| v_~A~0.base_27) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_15|) (<= 0 .cse1) (= (select |v_#valid_83| v_~A~0.base_27) 1) (not (= (mod v_~sorted1~0_24 256) 0)) (< (+ v_thread1Thread1of1ForFork1_~i~0_31 1) v_~N~0_29)))) InVars {~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 8311#[L84-4, L48-3]don't care [2022-07-22 12:50:23,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:23,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1519550245, now seen corresponding path program 3 times [2022-07-22 12:50:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:23,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500057378] [2022-07-22 12:50:23,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:23,132 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:23,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash 21722, now seen corresponding path program 3 times [2022-07-22 12:50:23,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:23,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794875207] [2022-07-22 12:50:23,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:23,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:23,202 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:23,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:23,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1074434, now seen corresponding path program 2 times [2022-07-22 12:50:23,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:23,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393738436] [2022-07-22 12:50:23,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:23,249 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:23,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:23,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:25,875 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:25,876 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:25,876 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:25,876 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:25,876 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:50:25,877 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:25,877 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:25,877 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:25,877 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration6_Lasso [2022-07-22 12:50:25,877 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:25,878 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:25,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:27,791 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:50:27,792 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:50:27,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:27,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:27,794 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:27,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-22 12:50:27,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:27,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:27,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:27,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:27,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:27,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:27,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:27,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:27,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:27,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:27,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:27,864 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:27,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-07-22 12:50:27,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:27,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:27,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:27,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:27,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:27,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:27,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-22 12:50:27,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:27,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-07-22 12:50:27,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:27,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:27,926 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:27,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-22 12:50:27,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:27,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:27,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:27,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:27,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:27,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:27,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:27,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:27,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2022-07-22 12:50:27,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:27,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:27,963 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:27,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-22 12:50:27,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:27,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:27,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:27,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:27,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:27,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:27,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:28,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:28,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:28,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:28,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:28,034 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:28,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-22 12:50:28,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:28,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:28,043 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 12:50:28,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:28,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:28,054 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-22 12:50:28,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:28,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:28,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:28,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:28,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:28,106 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:28,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:28,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:28,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:28,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:28,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:28,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:28,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:28,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-22 12:50:28,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:28,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:28,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:28,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:28,171 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:28,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:28,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:28,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:28,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:28,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:28,190 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:28,190 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:28,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-22 12:50:28,214 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:50:28,260 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2022-07-22 12:50:28,260 INFO L444 ModelExtractionUtils]: 8 out of 37 variables were initially zero. Simplification set additionally 26 variables to zero. [2022-07-22 12:50:28,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:28,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:28,265 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:28,267 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:50:28,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-07-22 12:50:28,276 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:50:28,277 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:50:28,277 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0, ~N~0) = -1*thread1Thread1of1ForFork1_~i~0 + 1*~N~0 Supporting invariants [] [2022-07-22 12:50:28,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:28,513 INFO L257 tatePredicateManager]: 43 out of 43 supporting invariants were superfluous and have been removed [2022-07-22 12:50:28,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:28,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:50:28,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:28,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:50:28,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:28,583 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:50:28,583 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 496 states and 2075 transitions. cyclomatic complexity: 1768 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:28,757 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 496 states and 2075 transitions. cyclomatic complexity: 1768. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1362 states and 5518 transitions. Complement of second has 5 states. [2022-07-22 12:50:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:50:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-07-22 12:50:28,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:50:28,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:28,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-22 12:50:28,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:28,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-22 12:50:28,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:28,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1362 states and 5518 transitions. [2022-07-22 12:50:28,791 INFO L131 ngComponentsAnalysis]: Automaton has 277 accepting balls. 449 [2022-07-22 12:50:28,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1362 states to 1246 states and 5066 transitions. [2022-07-22 12:50:28,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 833 [2022-07-22 12:50:28,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1075 [2022-07-22 12:50:28,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1246 states and 5066 transitions. [2022-07-22 12:50:28,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:50:28,821 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1246 states and 5066 transitions. [2022-07-22 12:50:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states and 5066 transitions. [2022-07-22 12:50:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 705. [2022-07-22 12:50:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 705 states have (on average 4.4425531914893615) internal successors, (3132), 704 states have internal predecessors, (3132), 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-07-22 12:50:28,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 3132 transitions. [2022-07-22 12:50:28,858 INFO L242 hiAutomatonCegarLoop]: Abstraction has 705 states and 3132 transitions. [2022-07-22 12:50:28,858 INFO L425 stractBuchiCegarLoop]: Abstraction has 705 states and 3132 transitions. [2022-07-22 12:50:28,858 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 12:50:28,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 705 states and 3132 transitions. [2022-07-22 12:50:28,868 INFO L131 ngComponentsAnalysis]: Automaton has 179 accepting balls. 299 [2022-07-22 12:50:28,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:28,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:28,869 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1] [2022-07-22 12:50:28,869 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:50:28,870 INFO L748 eck$LassoCheckResult]: Stem: 11289#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse2 (store |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1))) (let ((.cse0 (select |v_#memory_int_122| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51| 1))) (and (= v_~sorted1~0_64 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select .cse0 0) 48) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= v_~sorted3~0_82 0) (= (select .cse0 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= v_~A~0.offset_65 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_188| 2) 1) (= (select |v_#valid_188| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= v_~sorted2~0_62 0) (= 25 (select |v_#length_149| 2)) (= (select |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select |v_#length_149| 1) 2) (= |v_#valid_187| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= (select |v_#valid_188| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (store (store (store (store |v_#length_149| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_148|) (= v_~A~0.base_65 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_77) (= |v_#NULL.offset_16| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51|) 0) (= |v_#NULL.base_16| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_51|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_122|, #length=|v_#length_149|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_51|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_37|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_21|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_77, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_65, ~M~0=v_~M~0_49, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_187|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_21|, ~sorted1~0=v_~sorted1~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 10791#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 10793#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 10795#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 11403#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_57) (= v_~sorted2~0_50 1) (= |v_ULTIMATE.start_main_#t~pre16#1_31| |v_#pthreadsForks_61|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73| (ite (and (< v_~M~0_41 v_~N~0_67) (<= 0 v_~M~0_41)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (= v_~sorted1~0_56 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_57) (= (+ |v_#pthreadsForks_61| 1) |v_#pthreadsForks_60|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted3~0_70 1) (= (select |v_#valid_171| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_134| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_31|)) |v_#memory_int_112|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_61|, ~M~0=v_~M~0_41, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_113|, #length=|v_#length_134|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_57, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_57, #pthreadsForks=|v_#pthreadsForks_60|, ~M~0=v_~M~0_41, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_112|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_31|, #length=|v_#length_134|, ~sorted1~0=v_~sorted1~0_56, ~sorted2~0=v_~sorted2~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 11397#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 11393#[thread1ENTRY, L84-4]don't care [421] thread1ENTRY-->L47-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 11387#[L47-5, L84-4]don't care [613] L84-4-->L85-3: Formula: (and (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_15| |v_#pthreadsForks_37|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_19|) (= (select |v_#valid_115| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) 1) (= (store |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre18#1_15|)) |v_#memory_int_64|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_19| 4) (select |v_#length_86| |v_ULTIMATE.start_main_~#t2~0#1.base_21|))) InVars {#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_65|, #length=|v_#length_86|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_64|, #length=|v_#length_86|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 11389#[L47-5, L85-3]don't care [2022-07-22 12:50:28,871 INFO L750 eck$LassoCheckResult]: Loop: 11389#[L47-5, L85-3]don't care [652] L47-5-->L47-5: Formula: (let ((.cse0 (+ v_thread1Thread1of1ForFork1_~i~0_54 1))) (and (not |v_thread1Thread1of1ForFork1_#t~short4_40|) (= v_thread1Thread1of1ForFork1_~i~0_53 .cse0) (= (mod v_~sorted1~0_49 256) 0) (= v_~sorted1~0_48 (ite (= (ite |v_thread1Thread1of1ForFork1_#t~short4_40| 1 0) 0) 0 1)) (< .cse0 v_~N~0_55))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_54, ~N~0=v_~N~0_55, ~sorted1~0=v_~sorted1~0_49} OutVars{thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_29|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_23|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_19|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_39|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_53, ~N~0=v_~N~0_55, ~sorted1~0=v_~sorted1~0_48} AuxVars[|v_thread1Thread1of1ForFork1_#t~short4_40|] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, ~sorted1~0] 11389#[L47-5, L85-3]don't care [2022-07-22 12:50:28,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:28,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1519550278, now seen corresponding path program 1 times [2022-07-22 12:50:28,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:28,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368264577] [2022-07-22 12:50:28,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:28,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:28,927 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:28,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:28,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash 683, now seen corresponding path program 2 times [2022-07-22 12:50:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:28,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131462934] [2022-07-22 12:50:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:28,963 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:28,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:28,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:28,972 INFO L85 PathProgramCache]: Analyzing trace with hash -138580986, now seen corresponding path program 1 times [2022-07-22 12:50:28,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:28,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157930313] [2022-07-22 12:50:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:28,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:29,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-22 12:50:29,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:50:29,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157930313] [2022-07-22 12:50:29,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157930313] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:50:29,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:50:29,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:50:29,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260278427] [2022-07-22 12:50:29,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:50:29,105 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:29,105 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:29,105 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:29,105 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:29,105 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 12:50:29,105 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,106 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:29,106 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:29,106 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:50:29,106 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:29,106 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:29,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,234 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:50:29,234 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 12:50:29,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,236 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-07-22 12:50:29,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:29,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:29,253 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:29,253 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_7=-1} Honda state: {v_rep#funAddr~thread2.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:29,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2022-07-22 12:50:29,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,277 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-07-22 12:50:29,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:29,279 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:29,292 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:29,293 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.base_7=-1} Honda state: {v_rep#funAddr~thread3.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:29,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-07-22 12:50:29,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,316 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-07-22 12:50:29,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:29,317 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:29,331 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:29,331 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_7=-1} Honda state: {v_rep#funAddr~thread1.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:29,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:29,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,354 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-07-22 12:50:29,356 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:29,356 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:29,364 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:29,365 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~mem2=0} Honda state: {thread1Thread1of1ForFork1_#t~mem2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:29,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-07-22 12:50:29,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,388 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:29,389 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:29,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-07-22 12:50:29,403 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:29,403 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~sorted1~0=0} Honda state: {~sorted1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:29,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:29,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,427 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:29,428 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:29,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-07-22 12:50:29,442 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:29,442 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.offset_7=0} Honda state: {v_rep#funAddr~thread1.offset_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:29,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:29,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,465 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-07-22 12:50:29,466 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:29,466 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:29,480 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:29,481 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_7=1} Honda state: {v_rep#funAddr~thread2.offset_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:29,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2022-07-22 12:50:29,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,504 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-07-22 12:50:29,505 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:29,505 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:29,514 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:29,514 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~mem3=0} Honda state: {thread1Thread1of1ForFork1_#t~mem3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:29,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:29,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,538 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-07-22 12:50:29,541 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:29,541 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:29,549 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:29,549 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite thread1Thread1of1ForFork1_#t~short4 1 0)_4=0} Honda state: {v_rep(ite thread1Thread1of1ForFork1_#t~short4 1 0)_4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:29,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2022-07-22 12:50:29,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,573 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-07-22 12:50:29,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:29,574 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:29,583 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 12:50:29,583 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post1=0} Honda state: {thread1Thread1of1ForFork1_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 12:50:29,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:29,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,607 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-07-22 12:50:29,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 12:50:29,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:29,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-07-22 12:50:29,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,641 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-07-22 12:50:29,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 12:50:29,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 12:50:29,798 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 12:50:29,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2022-07-22 12:50:29,802 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:29,802 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:29,802 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:29,802 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:29,802 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:50:29,802 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,802 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:29,802 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:29,802 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration7_Loop [2022-07-22 12:50:29,802 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:29,802 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:29,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:29,943 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:50:29,943 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:50:29,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,944 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-07-22 12:50:29,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:29,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:29,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:29,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:29,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:29,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:29,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:29,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:29,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-07-22 12:50:29,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:29,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:29,983 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:29,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-07-22 12:50:29,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:29,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:29,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:29,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:29,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:29,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:29,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:29,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:30,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2022-07-22 12:50:30,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:30,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:30,020 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:30,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-07-22 12:50:30,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-07-22 12:50:30,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:30,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:30,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:30,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:30,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:30,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:30,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:30,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-07-22 12:50:30,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:30,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:30,057 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:30,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-07-22 12:50:30,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:30,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:30,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:30,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:30,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:30,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:30,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:30,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:30,068 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:30,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-07-22 12:50:30,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:30,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:30,091 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:30,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-07-22 12:50:30,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-07-22 12:50:30,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:30,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:30,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:30,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:30,102 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:30,102 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:30,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:30,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:30,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:30,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:30,135 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:30,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-07-22 12:50:30,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:30,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:30,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:30,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:30,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:30,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:30,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:30,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:30,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:30,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:30,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:30,174 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:30,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-07-22 12:50:30,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:30,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:30,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:30,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:30,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:30,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:30,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:30,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:30,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:30,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:30,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:30,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:30,209 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:30,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-07-22 12:50:30,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-07-22 12:50:30,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:30,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:30,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:30,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:30,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:30,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:30,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:30,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:30,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2022-07-22 12:50:30,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:30,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:30,245 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:30,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:30,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-07-22 12:50:30,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:30,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:30,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:30,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:30,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:30,256 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:30,256 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:30,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:30,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-07-22 12:50:30,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:30,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:30,282 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:30,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-07-22 12:50:30,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:30,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:30,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:30,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:30,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:30,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:30,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:30,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:30,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:30,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:30,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:30,318 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:30,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:30,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-07-22 12:50:30,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:30,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:30,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:30,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:30,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:30,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:30,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:30,330 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:50:30,335 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 12:50:30,335 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 12:50:30,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:30,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:30,336 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:30,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-07-22 12:50:30,337 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:50:30,337 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 12:50:30,337 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:50:30,338 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread1Thread1of1ForFork1_~i~0) = 1*~N~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2022-07-22 12:50:30,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:30,361 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 12:50:30,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:30,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:50:30,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:30,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:50:30,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:30,438 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-22 12:50:30,438 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 705 states and 3132 transitions. cyclomatic complexity: 2725 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-07-22 12:50:30,494 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 705 states and 3132 transitions. cyclomatic complexity: 2725. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 729 states and 3204 transitions. Complement of second has 3 states. [2022-07-22 12:50:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-07-22 12:50:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-07-22 12:50:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2022-07-22 12:50:30,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 8 letters. Loop has 1 letters. [2022-07-22 12:50:30,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:30,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 1 letters. [2022-07-22 12:50:30,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:30,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2022-07-22 12:50:30,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:30,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 729 states and 3204 transitions. [2022-07-22 12:50:30,516 INFO L131 ngComponentsAnalysis]: Automaton has 178 accepting balls. 298 [2022-07-22 12:50:30,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 729 states to 729 states and 3204 transitions. [2022-07-22 12:50:30,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 535 [2022-07-22 12:50:30,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 552 [2022-07-22 12:50:30,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 729 states and 3204 transitions. [2022-07-22 12:50:30,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:50:30,533 INFO L220 hiAutomatonCegarLoop]: Abstraction has 729 states and 3204 transitions. [2022-07-22 12:50:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states and 3204 transitions. [2022-07-22 12:50:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 706. [2022-07-22 12:50:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 706 states have (on average 4.441926345609065) internal successors, (3136), 705 states have internal predecessors, (3136), 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-07-22 12:50:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 3136 transitions. [2022-07-22 12:50:30,568 INFO L242 hiAutomatonCegarLoop]: Abstraction has 706 states and 3136 transitions. [2022-07-22 12:50:30,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:50:30,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:50:30,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:50:30,569 INFO L87 Difference]: Start difference. First operand 706 states and 3136 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-07-22 12:50:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:50:30,641 INFO L93 Difference]: Finished difference Result 826 states and 3330 transitions. [2022-07-22 12:50:30,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 826 states and 3330 transitions. [2022-07-22 12:50:30,658 INFO L131 ngComponentsAnalysis]: Automaton has 216 accepting balls. 366 [2022-07-22 12:50:30,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 826 states to 826 states and 3330 transitions. [2022-07-22 12:50:30,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 687 [2022-07-22 12:50:30,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 696 [2022-07-22 12:50:30,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 826 states and 3330 transitions. [2022-07-22 12:50:30,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:50:30,674 INFO L220 hiAutomatonCegarLoop]: Abstraction has 826 states and 3330 transitions. [2022-07-22 12:50:30,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states and 3330 transitions. [2022-07-22 12:50:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 618. [2022-07-22 12:50:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 618 states have (on average 4.145631067961165) internal successors, (2562), 617 states have internal predecessors, (2562), 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-07-22 12:50:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 2562 transitions. [2022-07-22 12:50:30,765 INFO L242 hiAutomatonCegarLoop]: Abstraction has 618 states and 2562 transitions. [2022-07-22 12:50:30,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:50:30,766 INFO L425 stractBuchiCegarLoop]: Abstraction has 618 states and 2562 transitions. [2022-07-22 12:50:30,767 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 12:50:30,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 618 states and 2562 transitions. [2022-07-22 12:50:30,787 INFO L131 ngComponentsAnalysis]: Automaton has 160 accepting balls. 280 [2022-07-22 12:50:30,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:30,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:30,788 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:50:30,788 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:50:30,792 INFO L748 eck$LassoCheckResult]: Stem: 15654#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse2 (store |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1))) (let ((.cse0 (select |v_#memory_int_122| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51| 1))) (and (= v_~sorted1~0_64 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select .cse0 0) 48) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= v_~sorted3~0_82 0) (= (select .cse0 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= v_~A~0.offset_65 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_188| 2) 1) (= (select |v_#valid_188| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= v_~sorted2~0_62 0) (= 25 (select |v_#length_149| 2)) (= (select |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select |v_#length_149| 1) 2) (= |v_#valid_187| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= (select |v_#valid_188| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (store (store (store (store |v_#length_149| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_148|) (= v_~A~0.base_65 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_77) (= |v_#NULL.offset_16| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51|) 0) (= |v_#NULL.base_16| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_51|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_122|, #length=|v_#length_149|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_51|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_37|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_21|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_77, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_65, ~M~0=v_~M~0_49, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_187|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_21|, ~sorted1~0=v_~sorted1~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 15204#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 15206#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_57) (= v_~sorted2~0_50 1) (= |v_ULTIMATE.start_main_#t~pre16#1_31| |v_#pthreadsForks_61|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73| (ite (and (< v_~M~0_41 v_~N~0_67) (<= 0 v_~M~0_41)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (= v_~sorted1~0_56 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_57) (= (+ |v_#pthreadsForks_61| 1) |v_#pthreadsForks_60|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted3~0_70 1) (= (select |v_#valid_171| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_134| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_31|)) |v_#memory_int_112|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_61|, ~M~0=v_~M~0_41, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_113|, #length=|v_#length_134|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_57, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_57, #pthreadsForks=|v_#pthreadsForks_60|, ~M~0=v_~M~0_41, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_112|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_31|, #length=|v_#length_134|, ~sorted1~0=v_~sorted1~0_56, ~sorted2~0=v_~sorted2~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 15210#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 15422#[thread1ENTRY, L84-4]don't care [613] L84-4-->L85-3: Formula: (and (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_15| |v_#pthreadsForks_37|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_19|) (= (select |v_#valid_115| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) 1) (= (store |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre18#1_15|)) |v_#memory_int_64|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_19| 4) (select |v_#length_86| |v_ULTIMATE.start_main_~#t2~0#1.base_21|))) InVars {#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_65|, #length=|v_#length_86|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_64|, #length=|v_#length_86|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 15424#[thread1ENTRY, L85-3]don't care [486] L85-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre18#1_6| v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_8|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_8|, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_16, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_4|, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_14|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_#t~post5=|v_thread2Thread1of1ForFork2_#t~post5_8|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_#t~mem7, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#t~short8, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_#t~post5, thread2Thread1of1ForFork2_#res.offset] 15156#[thread1ENTRY, thread2ENTRY, L85-4]don't care [440] thread2ENTRY-->L55-5: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] 15162#[L55-5, thread1ENTRY, L85-4]don't care [570] L55-5-->L56-3: Formula: (let ((.cse1 (* 4 v_thread2Thread1of1ForFork2_~i~1_29))) (let ((.cse0 (+ v_~A~0.offset_21 .cse1))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_50| v_~A~0.base_21) .cse0) |v_thread2Thread1of1ForFork2_#t~mem6_15|) (not (= (mod v_~sorted2~0_24 256) 0)) |v_thread2Thread1of1ForFork2_#t~short8_25| (= (select |v_#valid_79| v_~A~0.base_21) 1) (<= (+ v_~A~0.offset_21 4 .cse1) (select |v_#length_62| v_~A~0.base_21)) (< v_thread2Thread1of1ForFork2_~i~1_29 v_~M~0_17)))) InVars {~A~0.base=v_~A~0.base_21, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_29, ~A~0.offset=v_~A~0.offset_21, ~M~0=v_~M~0_17, #valid=|v_#valid_79|, #memory_int=|v_#memory_int_50|, #length=|v_#length_62|, ~sorted2~0=v_~sorted2~0_24} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_15|, ~A~0.base=v_~A~0.base_21, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_29, ~A~0.offset=v_~A~0.offset_21, ~M~0=v_~M~0_17, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_25|, #valid=|v_#valid_79|, #memory_int=|v_#memory_int_50|, #length=|v_#length_62|, ~sorted2~0=v_~sorted2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_#t~short8] 15386#[thread1ENTRY, L85-4, L56-3]don't care [2022-07-22 12:50:30,792 INFO L750 eck$LassoCheckResult]: Loop: 15386#[thread1ENTRY, L85-4, L56-3]don't care [659] L56-3-->L55-5: Formula: (let ((.cse1 (* 4 v_thread2Thread1of1ForFork2_~i~1_48))) (let ((.cse0 (+ .cse1 v_~A~0.offset_53 4))) (and (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_53 8) (select |v_#length_130| v_~A~0.base_53)) (= v_thread2Thread1of1ForFork2_~i~1_47 (+ v_thread2Thread1of1ForFork2_~i~1_48 1)) (let ((.cse2 (< |v_thread2Thread1of1ForFork2_#t~mem6_30| (select (select |v_#memory_int_108| v_~A~0.base_53) .cse0)))) (or (and |v_thread2Thread1of1ForFork2_#t~short8_38| .cse2) (and (not |v_thread2Thread1of1ForFork2_#t~short8_38|) (not .cse2)))) (= (select |v_#valid_167| v_~A~0.base_53) 1) (= v_~sorted2~0_48 (ite (= (ite |v_thread2Thread1of1ForFork2_#t~short8_38| 1 0) 0) 0 1))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_30|, ~A~0.base=v_~A~0.base_53, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_48, ~A~0.offset=v_~A~0.offset_53, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_108|, #length=|v_#length_130|} OutVars{thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_25|, ~A~0.base=v_~A~0.base_53, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_47, ~A~0.offset=v_~A~0.offset_53, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_37|, thread2Thread1of1ForFork2_#t~post5=|v_thread2Thread1of1ForFork2_#t~post5_19|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_108|, #length=|v_#length_130|, ~sorted2~0=v_~sorted2~0_48} AuxVars[|v_thread2Thread1of1ForFork2_#t~short8_38|] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_#t~mem7, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~short8, thread2Thread1of1ForFork2_#t~post5, ~sorted2~0] 15388#[L55-5, thread1ENTRY, L85-4]don't care [570] L55-5-->L56-3: Formula: (let ((.cse1 (* 4 v_thread2Thread1of1ForFork2_~i~1_29))) (let ((.cse0 (+ v_~A~0.offset_21 .cse1))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_50| v_~A~0.base_21) .cse0) |v_thread2Thread1of1ForFork2_#t~mem6_15|) (not (= (mod v_~sorted2~0_24 256) 0)) |v_thread2Thread1of1ForFork2_#t~short8_25| (= (select |v_#valid_79| v_~A~0.base_21) 1) (<= (+ v_~A~0.offset_21 4 .cse1) (select |v_#length_62| v_~A~0.base_21)) (< v_thread2Thread1of1ForFork2_~i~1_29 v_~M~0_17)))) InVars {~A~0.base=v_~A~0.base_21, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_29, ~A~0.offset=v_~A~0.offset_21, ~M~0=v_~M~0_17, #valid=|v_#valid_79|, #memory_int=|v_#memory_int_50|, #length=|v_#length_62|, ~sorted2~0=v_~sorted2~0_24} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_15|, ~A~0.base=v_~A~0.base_21, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_29, ~A~0.offset=v_~A~0.offset_21, ~M~0=v_~M~0_17, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_25|, #valid=|v_#valid_79|, #memory_int=|v_#memory_int_50|, #length=|v_#length_62|, ~sorted2~0=v_~sorted2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_#t~short8] 15386#[thread1ENTRY, L85-4, L56-3]don't care [2022-07-22 12:50:30,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:30,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1966945431, now seen corresponding path program 1 times [2022-07-22 12:50:30,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:30,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662827212] [2022-07-22 12:50:30,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:30,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:30,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:50:30,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662827212] [2022-07-22 12:50:30,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662827212] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:50:30,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366622428] [2022-07-22 12:50:30,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:30,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:50:30,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:30,881 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:50:30,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2022-07-22 12:50:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:30,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 12:50:30,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:31,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:50:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:31,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366622428] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:50:31,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:50:31,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-07-22 12:50:31,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480075825] [2022-07-22 12:50:31,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:50:31,104 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-07-22 12:50:31,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:31,105 INFO L85 PathProgramCache]: Analyzing trace with hash 21960, now seen corresponding path program 1 times [2022-07-22 12:50:31,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:31,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848472108] [2022-07-22 12:50:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:31,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:31,112 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:31,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:31,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:50:31,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 12:50:31,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-22 12:50:31,216 INFO L87 Difference]: Start difference. First operand 618 states and 2562 transitions. cyclomatic complexity: 2181 Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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-07-22 12:50:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:50:31,460 INFO L93 Difference]: Finished difference Result 670 states and 2652 transitions. [2022-07-22 12:50:31,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 670 states and 2652 transitions. [2022-07-22 12:50:31,472 INFO L131 ngComponentsAnalysis]: Automaton has 172 accepting balls. 284 [2022-07-22 12:50:31,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 670 states to 654 states and 2610 transitions. [2022-07-22 12:50:31,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 525 [2022-07-22 12:50:31,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 525 [2022-07-22 12:50:31,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 654 states and 2610 transitions. [2022-07-22 12:50:31,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:50:31,486 INFO L220 hiAutomatonCegarLoop]: Abstraction has 654 states and 2610 transitions. [2022-07-22 12:50:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states and 2610 transitions. [2022-07-22 12:50:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 634. [2022-07-22 12:50:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 634 states have (on average 4.056782334384858) internal successors, (2572), 633 states have internal predecessors, (2572), 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-07-22 12:50:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 2572 transitions. [2022-07-22 12:50:31,509 INFO L242 hiAutomatonCegarLoop]: Abstraction has 634 states and 2572 transitions. [2022-07-22 12:50:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:50:31,510 INFO L425 stractBuchiCegarLoop]: Abstraction has 634 states and 2572 transitions. [2022-07-22 12:50:31,510 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 12:50:31,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 2572 transitions. [2022-07-22 12:50:31,518 INFO L131 ngComponentsAnalysis]: Automaton has 164 accepting balls. 276 [2022-07-22 12:50:31,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:31,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:31,519 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1] [2022-07-22 12:50:31,519 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:50:31,520 INFO L748 eck$LassoCheckResult]: Stem: 17688#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse2 (store |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1))) (let ((.cse0 (select |v_#memory_int_122| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51| 1))) (and (= v_~sorted1~0_64 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select .cse0 0) 48) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= v_~sorted3~0_82 0) (= (select .cse0 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= v_~A~0.offset_65 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_188| 2) 1) (= (select |v_#valid_188| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= v_~sorted2~0_62 0) (= 25 (select |v_#length_149| 2)) (= (select |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select |v_#length_149| 1) 2) (= |v_#valid_187| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= (select |v_#valid_188| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (store (store (store (store |v_#length_149| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_148|) (= v_~A~0.base_65 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_77) (= |v_#NULL.offset_16| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51|) 0) (= |v_#NULL.base_16| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_51|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_122|, #length=|v_#length_149|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_51|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_37|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_21|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_77, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_65, ~M~0=v_~M~0_49, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_187|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_21|, ~sorted1~0=v_~sorted1~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 17178#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 17180#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 17182#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 17184#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_57) (= v_~sorted2~0_50 1) (= |v_ULTIMATE.start_main_#t~pre16#1_31| |v_#pthreadsForks_61|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73| (ite (and (< v_~M~0_41 v_~N~0_67) (<= 0 v_~M~0_41)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (= v_~sorted1~0_56 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_57) (= (+ |v_#pthreadsForks_61| 1) |v_#pthreadsForks_60|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted3~0_70 1) (= (select |v_#valid_171| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_134| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_31|)) |v_#memory_int_112|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_61|, ~M~0=v_~M~0_41, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_113|, #length=|v_#length_134|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_57, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_57, #pthreadsForks=|v_#pthreadsForks_60|, ~M~0=v_~M~0_41, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_112|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_31|, #length=|v_#length_134|, ~sorted1~0=v_~sorted1~0_56, ~sorted2~0=v_~sorted2~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 17844#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 17838#[thread1ENTRY, L84-4]don't care [421] thread1ENTRY-->L47-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 17840#[L47-5, L84-4]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_31 4))) (let ((.cse1 (+ v_~A~0.offset_27 .cse0))) (and |v_thread1Thread1of1ForFork1_#t~short4_25| (<= (+ v_~A~0.offset_27 .cse0 4) (select |v_#length_66| v_~A~0.base_27)) (= (select (select |v_#memory_int_52| v_~A~0.base_27) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_15|) (<= 0 .cse1) (= (select |v_#valid_83| v_~A~0.base_27) 1) (not (= (mod v_~sorted1~0_24 256) 0)) (< (+ v_thread1Thread1of1ForFork1_~i~0_31 1) v_~N~0_29)))) InVars {~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 17876#[L84-4, L48-3]don't care [613] L84-4-->L85-3: Formula: (and (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_15| |v_#pthreadsForks_37|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_19|) (= (select |v_#valid_115| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) 1) (= (store |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre18#1_15|)) |v_#memory_int_64|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_19| 4) (select |v_#length_86| |v_ULTIMATE.start_main_~#t2~0#1.base_21|))) InVars {#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_65|, #length=|v_#length_86|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_64|, #length=|v_#length_86|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 17230#[L85-3, L48-3]don't care [2022-07-22 12:50:31,521 INFO L750 eck$LassoCheckResult]: Loop: 17230#[L85-3, L48-3]don't care [651] L48-3-->L47-5: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_50 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_45 4))) (and (= v_~sorted1~0_46 (ite (= (ite |v_thread1Thread1of1ForFork1_#t~short4_36| 1 0) 0) 0 1)) (<= (+ .cse0 v_~A~0.offset_45 8) (select |v_#length_122| v_~A~0.base_45)) (<= 0 .cse1) (let ((.cse2 (< |v_thread1Thread1of1ForFork1_#t~mem2_26| (select (select |v_#memory_int_102| v_~A~0.base_45) .cse1)))) (or (and .cse2 |v_thread1Thread1of1ForFork1_#t~short4_36|) (and (not .cse2) (not |v_thread1Thread1of1ForFork1_#t~short4_36|)))) (= (select |v_#valid_159| v_~A~0.base_45) 1) (= v_thread1Thread1of1ForFork1_~i~0_49 (+ v_thread1Thread1of1ForFork1_~i~0_50 1))))) InVars {~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_26|, #valid=|v_#valid_159|, #memory_int=|v_#memory_int_102|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_50, #length=|v_#length_122|} OutVars{~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_21|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_35|, #valid=|v_#valid_159|, #memory_int=|v_#memory_int_102|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, #length=|v_#length_122|, ~sorted1~0=v_~sorted1~0_46} AuxVars[|v_thread1Thread1of1ForFork1_#t~short4_36|] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, ~sorted1~0] 18042#[L47-5, L85-3]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_31 4))) (let ((.cse1 (+ v_~A~0.offset_27 .cse0))) (and |v_thread1Thread1of1ForFork1_#t~short4_25| (<= (+ v_~A~0.offset_27 .cse0 4) (select |v_#length_66| v_~A~0.base_27)) (= (select (select |v_#memory_int_52| v_~A~0.base_27) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_15|) (<= 0 .cse1) (= (select |v_#valid_83| v_~A~0.base_27) 1) (not (= (mod v_~sorted1~0_24 256) 0)) (< (+ v_thread1Thread1of1ForFork1_~i~0_31 1) v_~N~0_29)))) InVars {~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 17230#[L85-3, L48-3]don't care [2022-07-22 12:50:31,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash -138582048, now seen corresponding path program 1 times [2022-07-22 12:50:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:31,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134291356] [2022-07-22 12:50:31,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:31,556 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:31,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:31,584 INFO L85 PathProgramCache]: Analyzing trace with hash 21722, now seen corresponding path program 4 times [2022-07-22 12:50:31,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:31,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746978119] [2022-07-22 12:50:31,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:31,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:31,593 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:31,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:31,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:31,604 INFO L85 PathProgramCache]: Analyzing trace with hash -33341191, now seen corresponding path program 1 times [2022-07-22 12:50:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:31,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427571194] [2022-07-22 12:50:31,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:31,667 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:31,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:35,162 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:35,162 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:35,162 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:35,163 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:35,163 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:50:35,163 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:35,163 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:35,163 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:35,163 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration9_Lasso [2022-07-22 12:50:35,163 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:35,163 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:35,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:35,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:36,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:37,356 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:50:37,356 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:50:37,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,358 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-07-22 12:50:37,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:37,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:37,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:37,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:37,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2022-07-22 12:50:37,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,392 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-07-22 12:50:37,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-07-22 12:50:37,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:37,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:37,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:37,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:37,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,429 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2022-07-22 12:50:37,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:37,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:37,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:37,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:37,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:37,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,465 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2022-07-22 12:50:37,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-07-22 12:50:37,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:37,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:37,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:37,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,502 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2022-07-22 12:50:37,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-07-22 12:50:37,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:37,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:37,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2022-07-22 12:50:37,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,544 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2022-07-22 12:50:37,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:37,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:37,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:37,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2022-07-22 12:50:37,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,583 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2022-07-22 12:50:37,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:37,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,593 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:37,593 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:37,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2022-07-22 12:50:37,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,619 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:37,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2022-07-22 12:50:37,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:37,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:37,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:37,630 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:37,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,653 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2022-07-22 12:50:37,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:37,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:37,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:37,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:37,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2022-07-22 12:50:37,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,686 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2022-07-22 12:50:37,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:37,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:37,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:37,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:37,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:37,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,721 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:37,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-07-22 12:50:37,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:37,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:37,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2022-07-22 12:50:37,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,763 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-07-22 12:50:37,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-07-22 12:50:37,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:37,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:37,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:37,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,800 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-07-22 12:50:37,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-07-22 12:50:37,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:37,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:37,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:37,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:37,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,833 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-07-22 12:50:37,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:37,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:37,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:37,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2022-07-22 12:50:37,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,869 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-07-22 12:50:37,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-07-22 12:50:37,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:37,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:37,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:37,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:37,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,904 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-07-22 12:50:37,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:37,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:50:37,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:50:37,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:50:37,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2022-07-22 12:50:37,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,938 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-07-22 12:50:37,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:37,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:37,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:37,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:37,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2022-07-22 12:50:37,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:37,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:37,974 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:37,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-07-22 12:50:37,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:37,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:37,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:37,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:37,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:37,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:37,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:37,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:38,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:38,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:38,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:38,010 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:38,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-07-22 12:50:38,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:38,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:38,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:38,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:38,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:38,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:38,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:38,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:38,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2022-07-22 12:50:38,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:38,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:38,047 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:38,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-07-22 12:50:38,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:38,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:38,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:38,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:38,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:38,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:38,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:38,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:38,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:38,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:38,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:38,082 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:38,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2022-07-22 12:50:38,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:38,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:38,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:38,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:38,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:38,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:38,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:38,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:38,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2022-07-22 12:50:38,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:38,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:38,119 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:38,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2022-07-22 12:50:38,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-07-22 12:50:38,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:38,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:38,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:38,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:38,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:38,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:38,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:50:38,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:38,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:38,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:38,159 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:38,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2022-07-22 12:50:38,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:50:38,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:50:38,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:50:38,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:50:38,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:50:38,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:50:38,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:50:38,193 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:50:38,209 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-22 12:50:38,209 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-07-22 12:50:38,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:38,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:38,212 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:50:38,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-07-22 12:50:38,213 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:50:38,221 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:50:38,221 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:50:38,221 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0, ~N~0) = -1*thread1Thread1of1ForFork1_~i~0 + 1*~N~0 Supporting invariants [] [2022-07-22 12:50:38,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2022-07-22 12:50:38,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:38,516 INFO L257 tatePredicateManager]: 51 out of 51 supporting invariants were superfluous and have been removed [2022-07-22 12:50:38,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:38,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:50:38,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:38,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:50:38,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:38,603 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:50:38,603 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 2572 transitions. cyclomatic complexity: 2179 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:38,714 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 2572 transitions. cyclomatic complexity: 2179. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1197 states and 4786 transitions. Complement of second has 5 states. [2022-07-22 12:50:38,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:50:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-07-22 12:50:38,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 9 letters. Loop has 2 letters. [2022-07-22 12:50:38,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:38,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-22 12:50:38,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:38,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-22 12:50:38,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:50:38,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1197 states and 4786 transitions. [2022-07-22 12:50:38,741 INFO L131 ngComponentsAnalysis]: Automaton has 220 accepting balls. 362 [2022-07-22 12:50:38,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1197 states to 1083 states and 4379 transitions. [2022-07-22 12:50:38,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 653 [2022-07-22 12:50:38,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 827 [2022-07-22 12:50:38,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1083 states and 4379 transitions. [2022-07-22 12:50:38,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:50:38,764 INFO L220 hiAutomatonCegarLoop]: Abstraction has 1083 states and 4379 transitions. [2022-07-22 12:50:38,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states and 4379 transitions. [2022-07-22 12:50:38,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 634. [2022-07-22 12:50:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 634 states have (on average 4.056782334384858) internal successors, (2572), 633 states have internal predecessors, (2572), 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-07-22 12:50:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 2572 transitions. [2022-07-22 12:50:38,792 INFO L242 hiAutomatonCegarLoop]: Abstraction has 634 states and 2572 transitions. [2022-07-22 12:50:38,792 INFO L425 stractBuchiCegarLoop]: Abstraction has 634 states and 2572 transitions. [2022-07-22 12:50:38,792 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 12:50:38,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 2572 transitions. [2022-07-22 12:50:38,800 INFO L131 ngComponentsAnalysis]: Automaton has 164 accepting balls. 276 [2022-07-22 12:50:38,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:38,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:38,801 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:50:38,801 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:50:38,802 INFO L748 eck$LassoCheckResult]: Stem: 20390#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse2 (store |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1))) (let ((.cse0 (select |v_#memory_int_122| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51| 1))) (and (= v_~sorted1~0_64 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select .cse0 0) 48) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= v_~sorted3~0_82 0) (= (select .cse0 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= v_~A~0.offset_65 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_188| 2) 1) (= (select |v_#valid_188| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= v_~sorted2~0_62 0) (= 25 (select |v_#length_149| 2)) (= (select |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select |v_#length_149| 1) 2) (= |v_#valid_187| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= (select |v_#valid_188| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (store (store (store (store |v_#length_149| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_148|) (= v_~A~0.base_65 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_77) (= |v_#NULL.offset_16| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51|) 0) (= |v_#NULL.base_16| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_51|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_122|, #length=|v_#length_149|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_51|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_37|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_21|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_77, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_65, ~M~0=v_~M~0_49, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_187|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_21|, ~sorted1~0=v_~sorted1~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 19876#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 19878#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 19880#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_57) (= v_~sorted2~0_50 1) (= |v_ULTIMATE.start_main_#t~pre16#1_31| |v_#pthreadsForks_61|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73| (ite (and (< v_~M~0_41 v_~N~0_67) (<= 0 v_~M~0_41)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (= v_~sorted1~0_56 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_57) (= (+ |v_#pthreadsForks_61| 1) |v_#pthreadsForks_60|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted3~0_70 1) (= (select |v_#valid_171| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_134| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_31|)) |v_#memory_int_112|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_61|, ~M~0=v_~M~0_41, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_113|, #length=|v_#length_134|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_57, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_57, #pthreadsForks=|v_#pthreadsForks_60|, ~M~0=v_~M~0_41, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_112|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_31|, #length=|v_#length_134|, ~sorted1~0=v_~sorted1~0_56, ~sorted2~0=v_~sorted2~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 20516#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 20708#[thread1ENTRY, L84-4]don't care [613] L84-4-->L85-3: Formula: (and (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_15| |v_#pthreadsForks_37|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_19|) (= (select |v_#valid_115| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) 1) (= (store |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre18#1_15|)) |v_#memory_int_64|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_19| 4) (select |v_#length_86| |v_ULTIMATE.start_main_~#t2~0#1.base_21|))) InVars {#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_65|, #length=|v_#length_86|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_64|, #length=|v_#length_86|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 20702#[thread1ENTRY, L85-3]don't care [486] L85-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre18#1_6| v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_8|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_8|, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_16, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_4|, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_14|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_#t~post5=|v_thread2Thread1of1ForFork2_#t~post5_8|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_#t~mem7, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#t~short8, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_#t~post5, thread2Thread1of1ForFork2_#res.offset] 20696#[thread1ENTRY, thread2ENTRY, L85-4]don't care [440] thread2ENTRY-->L55-5: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] 20700#[L55-5, thread1ENTRY, L85-4]don't care [570] L55-5-->L56-3: Formula: (let ((.cse1 (* 4 v_thread2Thread1of1ForFork2_~i~1_29))) (let ((.cse0 (+ v_~A~0.offset_21 .cse1))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_50| v_~A~0.base_21) .cse0) |v_thread2Thread1of1ForFork2_#t~mem6_15|) (not (= (mod v_~sorted2~0_24 256) 0)) |v_thread2Thread1of1ForFork2_#t~short8_25| (= (select |v_#valid_79| v_~A~0.base_21) 1) (<= (+ v_~A~0.offset_21 4 .cse1) (select |v_#length_62| v_~A~0.base_21)) (< v_thread2Thread1of1ForFork2_~i~1_29 v_~M~0_17)))) InVars {~A~0.base=v_~A~0.base_21, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_29, ~A~0.offset=v_~A~0.offset_21, ~M~0=v_~M~0_17, #valid=|v_#valid_79|, #memory_int=|v_#memory_int_50|, #length=|v_#length_62|, ~sorted2~0=v_~sorted2~0_24} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_15|, ~A~0.base=v_~A~0.base_21, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_29, ~A~0.offset=v_~A~0.offset_21, ~M~0=v_~M~0_17, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_25|, #valid=|v_#valid_79|, #memory_int=|v_#memory_int_50|, #length=|v_#length_62|, ~sorted2~0=v_~sorted2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_#t~short8] 20066#[thread1ENTRY, L85-4, L56-3]don't care [2022-07-22 12:50:38,803 INFO L750 eck$LassoCheckResult]: Loop: 20066#[thread1ENTRY, L85-4, L56-3]don't care [659] L56-3-->L55-5: Formula: (let ((.cse1 (* 4 v_thread2Thread1of1ForFork2_~i~1_48))) (let ((.cse0 (+ .cse1 v_~A~0.offset_53 4))) (and (<= 0 .cse0) (<= (+ .cse1 v_~A~0.offset_53 8) (select |v_#length_130| v_~A~0.base_53)) (= v_thread2Thread1of1ForFork2_~i~1_47 (+ v_thread2Thread1of1ForFork2_~i~1_48 1)) (let ((.cse2 (< |v_thread2Thread1of1ForFork2_#t~mem6_30| (select (select |v_#memory_int_108| v_~A~0.base_53) .cse0)))) (or (and |v_thread2Thread1of1ForFork2_#t~short8_38| .cse2) (and (not |v_thread2Thread1of1ForFork2_#t~short8_38|) (not .cse2)))) (= (select |v_#valid_167| v_~A~0.base_53) 1) (= v_~sorted2~0_48 (ite (= (ite |v_thread2Thread1of1ForFork2_#t~short8_38| 1 0) 0) 0 1))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_30|, ~A~0.base=v_~A~0.base_53, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_48, ~A~0.offset=v_~A~0.offset_53, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_108|, #length=|v_#length_130|} OutVars{thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_25|, ~A~0.base=v_~A~0.base_53, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_47, ~A~0.offset=v_~A~0.offset_53, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_37|, thread2Thread1of1ForFork2_#t~post5=|v_thread2Thread1of1ForFork2_#t~post5_19|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_108|, #length=|v_#length_130|, ~sorted2~0=v_~sorted2~0_48} AuxVars[|v_thread2Thread1of1ForFork2_#t~short8_38|] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_#t~mem7, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~short8, thread2Thread1of1ForFork2_#t~post5, ~sorted2~0] 20068#[L55-5, thread1ENTRY, L85-4]don't care [570] L55-5-->L56-3: Formula: (let ((.cse1 (* 4 v_thread2Thread1of1ForFork2_~i~1_29))) (let ((.cse0 (+ v_~A~0.offset_21 .cse1))) (and (<= 0 .cse0) (= (select (select |v_#memory_int_50| v_~A~0.base_21) .cse0) |v_thread2Thread1of1ForFork2_#t~mem6_15|) (not (= (mod v_~sorted2~0_24 256) 0)) |v_thread2Thread1of1ForFork2_#t~short8_25| (= (select |v_#valid_79| v_~A~0.base_21) 1) (<= (+ v_~A~0.offset_21 4 .cse1) (select |v_#length_62| v_~A~0.base_21)) (< v_thread2Thread1of1ForFork2_~i~1_29 v_~M~0_17)))) InVars {~A~0.base=v_~A~0.base_21, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_29, ~A~0.offset=v_~A~0.offset_21, ~M~0=v_~M~0_17, #valid=|v_#valid_79|, #memory_int=|v_#memory_int_50|, #length=|v_#length_62|, ~sorted2~0=v_~sorted2~0_24} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_15|, ~A~0.base=v_~A~0.base_21, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_29, ~A~0.offset=v_~A~0.offset_21, ~M~0=v_~M~0_17, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_25|, #valid=|v_#valid_79|, #memory_int=|v_#memory_int_50|, #length=|v_#length_62|, ~sorted2~0=v_~sorted2~0_24} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_#t~short8] 20066#[thread1ENTRY, L85-4, L56-3]don't care [2022-07-22 12:50:38,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:38,803 INFO L85 PathProgramCache]: Analyzing trace with hash 644800588, now seen corresponding path program 2 times [2022-07-22 12:50:38,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:38,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277325137] [2022-07-22 12:50:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:38,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:38,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:38,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:38,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:38,861 INFO L85 PathProgramCache]: Analyzing trace with hash 21960, now seen corresponding path program 2 times [2022-07-22 12:50:38,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:38,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228571072] [2022-07-22 12:50:38,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:38,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:38,867 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:38,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:38,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:38,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1178095443, now seen corresponding path program 1 times [2022-07-22 12:50:38,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:38,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222686203] [2022-07-22 12:50:38,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:38,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:38,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:50:38,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222686203] [2022-07-22 12:50:38,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222686203] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:50:38,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486685240] [2022-07-22 12:50:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:38,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:50:38,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:38,964 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:50:38,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2022-07-22 12:50:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:39,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 12:50:39,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:39,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:50:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:39,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486685240] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:50:39,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:50:39,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-07-22 12:50:39,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621425294] [2022-07-22 12:50:39,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:50:39,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:50:39,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 12:50:39,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-07-22 12:50:39,385 INFO L87 Difference]: Start difference. First operand 634 states and 2572 transitions. cyclomatic complexity: 2179 Second operand has 18 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:50:40,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:50:40,016 INFO L93 Difference]: Finished difference Result 804 states and 2958 transitions. [2022-07-22 12:50:40,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 804 states and 2958 transitions. [2022-07-22 12:50:40,029 INFO L131 ngComponentsAnalysis]: Automaton has 206 accepting balls. 294 [2022-07-22 12:50:40,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 804 states to 756 states and 2806 transitions. [2022-07-22 12:50:40,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 627 [2022-07-22 12:50:40,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 627 [2022-07-22 12:50:40,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 756 states and 2806 transitions. [2022-07-22 12:50:40,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:50:40,044 INFO L220 hiAutomatonCegarLoop]: Abstraction has 756 states and 2806 transitions. [2022-07-22 12:50:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states and 2806 transitions. [2022-07-22 12:50:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 662. [2022-07-22 12:50:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 662 states have (on average 3.9244712990936557) internal successors, (2598), 661 states have internal predecessors, (2598), 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-07-22 12:50:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2598 transitions. [2022-07-22 12:50:40,069 INFO L242 hiAutomatonCegarLoop]: Abstraction has 662 states and 2598 transitions. [2022-07-22 12:50:40,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 12:50:40,070 INFO L425 stractBuchiCegarLoop]: Abstraction has 662 states and 2598 transitions. [2022-07-22 12:50:40,070 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 12:50:40,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 662 states and 2598 transitions. [2022-07-22 12:50:40,078 INFO L131 ngComponentsAnalysis]: Automaton has 170 accepting balls. 258 [2022-07-22 12:50:40,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:40,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:40,079 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:50:40,079 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2022-07-22 12:50:40,080 INFO L748 eck$LassoCheckResult]: Stem: 22561#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse2 (store |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1))) (let ((.cse0 (select |v_#memory_int_122| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51| 1))) (and (= v_~sorted1~0_64 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select .cse0 0) 48) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= v_~sorted3~0_82 0) (= (select .cse0 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= v_~A~0.offset_65 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_188| 2) 1) (= (select |v_#valid_188| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= v_~sorted2~0_62 0) (= 25 (select |v_#length_149| 2)) (= (select |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select |v_#length_149| 1) 2) (= |v_#valid_187| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= (select |v_#valid_188| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (store (store (store (store |v_#length_149| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_148|) (= v_~A~0.base_65 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_77) (= |v_#NULL.offset_16| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51|) 0) (= |v_#NULL.base_16| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_51|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_122|, #length=|v_#length_149|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_51|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_37|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_21|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_77, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_65, ~M~0=v_~M~0_49, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_187|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_21|, ~sorted1~0=v_~sorted1~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 22047#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 22049#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_57) (= v_~sorted2~0_50 1) (= |v_ULTIMATE.start_main_#t~pre16#1_31| |v_#pthreadsForks_61|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73| (ite (and (< v_~M~0_41 v_~N~0_67) (<= 0 v_~M~0_41)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (= v_~sorted1~0_56 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_57) (= (+ |v_#pthreadsForks_61| 1) |v_#pthreadsForks_60|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted3~0_70 1) (= (select |v_#valid_171| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_134| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_31|)) |v_#memory_int_112|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_61|, ~M~0=v_~M~0_41, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_113|, #length=|v_#length_134|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_57, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_57, #pthreadsForks=|v_#pthreadsForks_60|, ~M~0=v_~M~0_41, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_112|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_31|, #length=|v_#length_134|, ~sorted1~0=v_~sorted1~0_56, ~sorted2~0=v_~sorted2~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 22377#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 22299#[thread1ENTRY, L84-4]don't care [613] L84-4-->L85-3: Formula: (and (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_15| |v_#pthreadsForks_37|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_19|) (= (select |v_#valid_115| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) 1) (= (store |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre18#1_15|)) |v_#memory_int_64|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_19| 4) (select |v_#length_86| |v_ULTIMATE.start_main_~#t2~0#1.base_21|))) InVars {#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_65|, #length=|v_#length_86|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_64|, #length=|v_#length_86|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 22301#[thread1ENTRY, L85-3]don't care [486] L85-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre18#1_6| v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_8|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_8|, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_16, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_4|, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_14|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_#t~post5=|v_thread2Thread1of1ForFork2_#t~post5_8|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_#t~mem7, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#t~short8, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_#t~post5, thread2Thread1of1ForFork2_#res.offset] 22853#[thread1ENTRY, thread2ENTRY, L85-4]don't care [631] L85-4-->L86-3: Formula: (and (= (select |v_#valid_137| |v_ULTIMATE.start_main_~#t3~0#1.base_33|) 1) (= (store |v_#memory_int_85| |v_ULTIMATE.start_main_~#t3~0#1.base_33| (store (select |v_#memory_int_85| |v_ULTIMATE.start_main_~#t3~0#1.base_33|) |v_ULTIMATE.start_main_~#t3~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre20#1_19|)) |v_#memory_int_84|) (<= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_27|) (= (+ |v_#pthreadsForks_49| 1) |v_#pthreadsForks_48|) (<= (+ |v_ULTIMATE.start_main_~#t3~0#1.offset_27| 4) (select |v_#length_104| |v_ULTIMATE.start_main_~#t3~0#1.base_33|)) (= |v_#pthreadsForks_49| |v_ULTIMATE.start_main_#t~pre20#1_19|)) InVars {#pthreadsForks=|v_#pthreadsForks_49|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_85|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_33|, #length=|v_#length_104|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_19|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_19|, #pthreadsForks=|v_#pthreadsForks_48|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_27|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_84|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_33|, #length=|v_#length_104|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_main_#t~pre20#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet19#1] 22845#[thread1ENTRY, thread2ENTRY, L86-3]don't care [480] L86-3-->thread3ENTRY: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar2_2 0) (= v_thread3Thread1of1ForFork0_thidvar1_2 0) (= v_thread3Thread1of1ForFork0_thidvar3_2 0) (= v_thread3Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre20#1_6|)) InVars {ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|} OutVars{ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_6|, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_8|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_8|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_4|, thread3Thread1of1ForFork0_#t~short12=|v_thread3Thread1of1ForFork0_#t~short12_14|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_16, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_2, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_4|, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_2, thread3Thread1of1ForFork0_#t~post9=|v_thread3Thread1of1ForFork0_#t~post9_8|, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_2, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#t~short12, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_thidvar3, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_thidvar2, thread3Thread1of1ForFork0_#t~post9, thread3Thread1of1ForFork0_thidvar1, thread3Thread1of1ForFork0_thidvar0] 22011#[thread2ENTRY, thread1ENTRY, thread3ENTRY, L86-4]don't care [459] thread3ENTRY-->L63-5: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] 22017#[L63-5, thread2ENTRY, thread1ENTRY, L86-4]don't care [2022-07-22 12:50:40,080 INFO L750 eck$LassoCheckResult]: Loop: 22017#[L63-5, thread2ENTRY, thread1ENTRY, L86-4]don't care [667] L63-5-->L63-5: Formula: (let ((.cse7 (+ v_thread3Thread1of1ForFork0_~i~2_In_3 1))) (let ((.cse2 (= (mod v_~sorted3~0_In_1 256) 0)) (.cse1 (= v_thread3Thread1of1ForFork0_~i~2_Out_2 .cse7)) (.cse6 (< .cse7 v_~N~0_In_5))) (or (let ((.cse5 (* v_thread3Thread1of1ForFork0_~i~2_In_3 4))) (let ((.cse0 (+ v_~A~0.offset_In_1 .cse5))) (and (<= 0 .cse0) .cse1 (not .cse2) (= 1 (select |v_#valid_In_3| v_~A~0.base_In_1)) (let ((.cse3 (let ((.cse4 (select |v_#memory_int_In_3| v_~A~0.base_In_1))) (< (select .cse4 .cse0) (select .cse4 (+ v_~A~0.offset_In_1 .cse5 4)))))) (or (and .cse3 |v_thread3Thread1of1ForFork0_#t~short12_63|) (and (not .cse3) (not |v_thread3Thread1of1ForFork0_#t~short12_63|)))) (<= (+ v_~A~0.offset_In_1 .cse5 8) (select |v_#length_In_3| v_~A~0.base_In_1)) (= (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short12_63| 1 0) 0) 0 1) v_~sorted3~0_Out_2) .cse6 |v_thread3Thread1of1ForFork0_#t~short12_64|))) (and .cse2 .cse1 (= v_~sorted3~0_Out_2 (ite (= (ite |v_thread3Thread1of1ForFork0_#t~short12_65| 1 0) 0) 0 1)) .cse6 (not |v_thread3Thread1of1ForFork0_#t~short12_65|))))) InVars {~sorted3~0=v_~sorted3~0_In_1, ~A~0.base=v_~A~0.base_In_1, ~A~0.offset=v_~A~0.offset_In_1, #valid=|v_#valid_In_3|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, #memory_int=|v_#memory_int_In_3|, #length=|v_#length_In_3|, ~N~0=v_~N~0_In_5} OutVars{~A~0.base=v_~A~0.base_In_1, thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_Out_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_Out_2|, thread3Thread1of1ForFork0_#t~short12=|v_thread3Thread1of1ForFork0_#t~short12_Out_2|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_Out_2, ~N~0=v_~N~0_In_5, ~sorted3~0=v_~sorted3~0_Out_2, ~A~0.offset=v_~A~0.offset_In_1, #valid=|v_#valid_In_3|, #memory_int=|v_#memory_int_In_3|, thread3Thread1of1ForFork0_#t~post9=|v_thread3Thread1of1ForFork0_#t~post9_Out_2|, #length=|v_#length_In_3|} AuxVars[|v_thread3Thread1of1ForFork0_#t~short12_64|, |v_thread3Thread1of1ForFork0_#t~short12_65|, |v_thread3Thread1of1ForFork0_#t~short12_63|] AssignedVars[~sorted3~0, thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, thread3Thread1of1ForFork0_#t~short12, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~post9] 22017#[L63-5, thread2ENTRY, thread1ENTRY, L86-4]don't care [2022-07-22 12:50:40,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:40,080 INFO L85 PathProgramCache]: Analyzing trace with hash -845584997, now seen corresponding path program 1 times [2022-07-22 12:50:40,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:40,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124744755] [2022-07-22 12:50:40,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:40,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:40,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:40,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:40,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash 698, now seen corresponding path program 1 times [2022-07-22 12:50:40,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:40,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100637879] [2022-07-22 12:50:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:40,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:40,131 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:40,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:40,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash -443330464, now seen corresponding path program 1 times [2022-07-22 12:50:40,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:40,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489865606] [2022-07-22 12:50:40,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:40,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:40,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:50:40,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489865606] [2022-07-22 12:50:40,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489865606] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 12:50:40,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273162877] [2022-07-22 12:50:40,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:40,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 12:50:40,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:50:40,246 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 12:50:40,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2022-07-22 12:50:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:50:40,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-22 12:50:40,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:50:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:40,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 12:50:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:50:40,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273162877] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 12:50:40,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 12:50:40,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-07-22 12:50:40,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539471174] [2022-07-22 12:50:40,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 12:50:40,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:50:40,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 12:50:40,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-22 12:50:40,688 INFO L87 Difference]: Start difference. First operand 662 states and 2598 transitions. cyclomatic complexity: 2183 Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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-07-22 12:50:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:50:40,984 INFO L93 Difference]: Finished difference Result 698 states and 2656 transitions. [2022-07-22 12:50:40,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 698 states and 2656 transitions. [2022-07-22 12:50:40,995 INFO L131 ngComponentsAnalysis]: Automaton has 158 accepting balls. 246 [2022-07-22 12:50:41,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 698 states to 621 states and 2486 transitions. [2022-07-22 12:50:41,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 492 [2022-07-22 12:50:41,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 492 [2022-07-22 12:50:41,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 621 states and 2486 transitions. [2022-07-22 12:50:41,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:50:41,033 INFO L220 hiAutomatonCegarLoop]: Abstraction has 621 states and 2486 transitions. [2022-07-22 12:50:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states and 2486 transitions. [2022-07-22 12:50:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2022-07-22 12:50:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 621 states have (on average 4.003220611916264) internal successors, (2486), 620 states have internal predecessors, (2486), 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-07-22 12:50:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 2486 transitions. [2022-07-22 12:50:41,054 INFO L242 hiAutomatonCegarLoop]: Abstraction has 621 states and 2486 transitions. [2022-07-22 12:50:41,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 12:50:41,055 INFO L425 stractBuchiCegarLoop]: Abstraction has 621 states and 2486 transitions. [2022-07-22 12:50:41,055 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 12:50:41,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 621 states and 2486 transitions. [2022-07-22 12:50:41,063 INFO L131 ngComponentsAnalysis]: Automaton has 158 accepting balls. 246 [2022-07-22 12:50:41,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:50:41,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:50:41,063 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 12:50:41,063 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 12:50:41,065 INFO L748 eck$LassoCheckResult]: Stem: 24666#[ULTIMATE.startENTRY]don't care [669] ULTIMATE.startENTRY-->L102-6: Formula: (let ((.cse2 (store |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45| 1))) (let ((.cse0 (select |v_#memory_int_122| 1)) (.cse1 (store .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51| 1))) (and (= v_~sorted1~0_64 0) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t2~0#1.base_45|) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_39| 0) (= (select .cse0 0) 48) (= (select .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|) 0) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 0)) (= v_~sorted3~0_82 0) (= (select .cse0 1) 0) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_107| 0)) (= (select .cse2 |v_ULTIMATE.start_main_~#t2~0#1.base_45|) 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_43| 0) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48| 0) (= v_~A~0.offset_65 0) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37| 0) (= (select |v_#valid_188| 2) 1) (= (select |v_#valid_188| 1) 1) (not (= (ite (<= 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|) 1 0) 0)) (= v_~sorted2~0_62 0) (= 25 (select |v_#length_149| 2)) (= (select |v_#valid_188| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= (select |v_#length_149| 1) 2) (= |v_#valid_187| (store .cse1 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| 1)) (= (select |v_#valid_188| 0) 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_54| 4294967296) 1073741823) 1 0)) (= (store (store (store (store |v_#length_149| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_45| 4) |v_ULTIMATE.start_main_~#t3~0#1.base_51| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| (* 4 |v_ULTIMATE.start_create_fresh_int_array_~size#1_54|)) |v_#length_148|) (= v_~A~0.base_65 0) (< 0 |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_43| 0) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37| |v_#StackHeapBarrier_32|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21| v_~N~0_77) (= |v_#NULL.offset_16| 0) (= (select .cse3 |v_ULTIMATE.start_main_~#t3~0#1.base_51|) 0) (= |v_#NULL.base_16| 0) (< |v_#StackHeapBarrier_32| |v_ULTIMATE.start_main_~#t3~0#1.base_51|))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_32|, #valid=|v_#valid_188|, #memory_int=|v_#memory_int_122|, #length=|v_#length_149|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_37|, ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_33|, ~A~0.base=v_~A~0.base_65, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base_27|, ULTIMATE.start_main_#t~nondet21#1=|v_ULTIMATE.start_main_#t~nondet21#1_19|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_39|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_43|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_51|, #NULL.offset=|v_#NULL.offset_16|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_28|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|, ULTIMATE.start_main_#t~pre20#1=|v_ULTIMATE.start_main_#t~pre20#1_29|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_21|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_107|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_32|, #length=|v_#length_148|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_37|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_29|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_21|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_24|, ~sorted2~0=v_~sorted2~0_62, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_37|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_32|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_22|, ~N~0=v_~N~0_77, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset_27|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_54|, #NULL.base=|v_#NULL.base_16|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_36|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_28|, ~sorted3~0=v_~sorted3~0_82, #StackHeapBarrier=|v_#StackHeapBarrier_32|, ~A~0.offset=v_~A~0.offset_65, ~M~0=v_~M~0_49, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_33|, #valid=|v_#valid_187|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_26|, ULTIMATE.start_main_#t~nondet19#1=|v_ULTIMATE.start_main_#t~nondet19#1_21|, ~sorted1~0=v_~sorted1~0_64, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_45|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.base, ULTIMATE.start_main_#t~nondet21#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, #NULL.offset, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~pre20#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet13#1, #length, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1, ULTIMATE.start_main_#t~nondet17#1, ULTIMATE.start_main_#t~mem22#1, ~sorted2~0, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem23#1, ~N~0, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc25#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, #NULL.base, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~sorted3~0, ~A~0.offset, ~M~0, ULTIMATE.start_main_#t~ret15#1.base, #valid, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_main_#t~nondet19#1, ~sorted1~0, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem24#1] 24146#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 24148#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 24878#[L102-6]don't care [629] L102-6-->L102-6: Formula: (let ((.cse1 (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 4))) (let ((.cse0 (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| .cse1))) (and (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28| (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| 1)) (= (select |v_#valid_135| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) 1) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29| |v_ULTIMATE.start_create_fresh_int_array_~size#1_36|) (= |v_#memory_int_80| (store |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19| (store (select |v_#memory_int_81| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|) .cse0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|))) (<= 0 .cse0) (<= (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19| 4 .cse1) (select |v_#length_102| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|))))) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_81|, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet27#1_15|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_29|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_19|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_19|, #valid=|v_#valid_135|, #memory_int=|v_#memory_int_80|, #length=|v_#length_102|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_28|, ULTIMATE.start_create_fresh_int_array_#t~post26#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post26#1_19|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_36|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_create_fresh_int_array_#t~nondet27#1, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post26#1] 24150#[L102-6]don't care [662] L102-6-->L84-3: Formula: (and (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| v_~A~0.offset_57) (= v_~sorted2~0_50 1) (= |v_ULTIMATE.start_main_#t~pre16#1_31| |v_#pthreadsForks_61|) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73| (ite (and (< v_~M~0_41 v_~N~0_67) (<= 0 v_~M~0_41)) 1 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|) (= v_~sorted1~0_56 1) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| v_~A~0.base_57) (= (+ |v_#pthreadsForks_61| 1) |v_#pthreadsForks_60|) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40| |v_ULTIMATE.start_create_fresh_int_array_~size#1_48|)) (= |v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|) (= v_~sorted3~0_70 1) (= (select |v_#valid_171| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_134| |v_ULTIMATE.start_main_~#t1~0#1.base_39|)) (= (store |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~#t1~0#1.base_39|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre16#1_31|)) |v_#memory_int_112|) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, #pthreadsForks=|v_#pthreadsForks_61|, ~M~0=v_~M~0_41, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_113|, #length=|v_#length_134|} OutVars{ULTIMATE.start_main_#t~ret15#1.offset=|v_ULTIMATE.start_main_#t~ret15#1.offset_27|, ~A~0.base=v_~A~0.base_57, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_29|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_29|, ~N~0=v_~N~0_67, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_39|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_22|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_40|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_48|, ~sorted3~0=v_~sorted3~0_70, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_22|, ~A~0.offset=v_~A~0.offset_57, #pthreadsForks=|v_#pthreadsForks_60|, ~M~0=v_~M~0_41, ULTIMATE.start_main_#t~ret15#1.base=|v_ULTIMATE.start_main_#t~ret15#1.base_27|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, #valid=|v_#valid_171|, #memory_int=|v_#memory_int_112|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_31|, #length=|v_#length_134|, ~sorted1~0=v_~sorted1~0_56, ~sorted2~0=v_~sorted2~0_50, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_73|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret15#1.offset, ~A~0.base, ULTIMATE.start_create_fresh_int_array_#res#1.base, ~sorted3~0, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~A~0.offset, #pthreadsForks, ULTIMATE.start_main_#t~ret15#1.base, ULTIMATE.start_assume_abort_if_not_~cond#1, #memory_int, ULTIMATE.start_main_#t~pre16#1, ~sorted1~0, ~sorted2~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] 24152#[L84-3]don't care [483] L84-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre16#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_8|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_8|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_14|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_16, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 24398#[thread1ENTRY, L84-4]don't care [421] thread1ENTRY-->L47-5: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 24400#[L47-5, L84-4]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_31 4))) (let ((.cse1 (+ v_~A~0.offset_27 .cse0))) (and |v_thread1Thread1of1ForFork1_#t~short4_25| (<= (+ v_~A~0.offset_27 .cse0 4) (select |v_#length_66| v_~A~0.base_27)) (= (select (select |v_#memory_int_52| v_~A~0.base_27) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_15|) (<= 0 .cse1) (= (select |v_#valid_83| v_~A~0.base_27) 1) (not (= (mod v_~sorted1~0_24 256) 0)) (< (+ v_thread1Thread1of1ForFork1_~i~0_31 1) v_~N~0_29)))) InVars {~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 24974#[L84-4, L48-3]don't care [613] L84-4-->L85-3: Formula: (and (= |v_#pthreadsForks_36| (+ |v_#pthreadsForks_37| 1)) (= |v_ULTIMATE.start_main_#t~pre18#1_15| |v_#pthreadsForks_37|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_19|) (= (select |v_#valid_115| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) 1) (= (store |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21| (store (select |v_#memory_int_65| |v_ULTIMATE.start_main_~#t2~0#1.base_21|) |v_ULTIMATE.start_main_~#t2~0#1.offset_19| |v_ULTIMATE.start_main_#t~pre18#1_15|)) |v_#memory_int_64|) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_19| 4) (select |v_#length_86| |v_ULTIMATE.start_main_~#t2~0#1.base_21|))) InVars {#pthreadsForks=|v_#pthreadsForks_37|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_65|, #length=|v_#length_86|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} OutVars{ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_15|, #pthreadsForks=|v_#pthreadsForks_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_19|, #valid=|v_#valid_115|, #memory_int=|v_#memory_int_64|, #length=|v_#length_86|, ULTIMATE.start_main_#t~pre16#1=|v_ULTIMATE.start_main_#t~pre16#1_15|, ULTIMATE.start_main_#t~nondet17#1=|v_ULTIMATE.start_main_#t~nondet17#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre18#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre16#1, ULTIMATE.start_main_#t~nondet17#1] 24604#[L85-3, L48-3]don't care [486] L85-3-->thread2ENTRY: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_2) (= 0 v_thread2Thread1of1ForFork2_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre18#1_6| v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_8|, ULTIMATE.start_main_#t~pre18#1=|v_ULTIMATE.start_main_#t~pre18#1_6|, thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_2, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_8|, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_16, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_4|, thread2Thread1of1ForFork2_#t~short8=|v_thread2Thread1of1ForFork2_#t~short8_14|, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2, thread2Thread1of1ForFork2_#t~post5=|v_thread2Thread1of1ForFork2_#t~post5_8|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_thidvar2, thread2Thread1of1ForFork2_#t~mem7, thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#t~short8, thread2Thread1of1ForFork2_thidvar0, thread2Thread1of1ForFork2_#t~post5, thread2Thread1of1ForFork2_#res.offset] 23982#[thread2ENTRY, L85-4, L48-3]don't care [2022-07-22 12:50:41,065 INFO L750 eck$LassoCheckResult]: Loop: 23982#[thread2ENTRY, L85-4, L48-3]don't care [651] L48-3-->L47-5: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_50 4))) (let ((.cse1 (+ .cse0 v_~A~0.offset_45 4))) (and (= v_~sorted1~0_46 (ite (= (ite |v_thread1Thread1of1ForFork1_#t~short4_36| 1 0) 0) 0 1)) (<= (+ .cse0 v_~A~0.offset_45 8) (select |v_#length_122| v_~A~0.base_45)) (<= 0 .cse1) (let ((.cse2 (< |v_thread1Thread1of1ForFork1_#t~mem2_26| (select (select |v_#memory_int_102| v_~A~0.base_45) .cse1)))) (or (and .cse2 |v_thread1Thread1of1ForFork1_#t~short4_36|) (and (not .cse2) (not |v_thread1Thread1of1ForFork1_#t~short4_36|)))) (= (select |v_#valid_159| v_~A~0.base_45) 1) (= v_thread1Thread1of1ForFork1_~i~0_49 (+ v_thread1Thread1of1ForFork1_~i~0_50 1))))) InVars {~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_26|, #valid=|v_#valid_159|, #memory_int=|v_#memory_int_102|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_50, #length=|v_#length_122|} OutVars{~A~0.base=v_~A~0.base_45, ~A~0.offset=v_~A~0.offset_45, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_21|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_17|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_35|, #valid=|v_#valid_159|, #memory_int=|v_#memory_int_102|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_49, #length=|v_#length_122|, ~sorted1~0=v_~sorted1~0_46} AuxVars[|v_thread1Thread1of1ForFork1_#t~short4_36|] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~short4, thread1Thread1of1ForFork1_~i~0, ~sorted1~0] 24194#[thread2ENTRY, L47-5, L85-4]don't care [580] L47-5-->L48-3: Formula: (let ((.cse0 (* v_thread1Thread1of1ForFork1_~i~0_31 4))) (let ((.cse1 (+ v_~A~0.offset_27 .cse0))) (and |v_thread1Thread1of1ForFork1_#t~short4_25| (<= (+ v_~A~0.offset_27 .cse0 4) (select |v_#length_66| v_~A~0.base_27)) (= (select (select |v_#memory_int_52| v_~A~0.base_27) .cse1) |v_thread1Thread1of1ForFork1_#t~mem2_15|) (<= 0 .cse1) (= (select |v_#valid_83| v_~A~0.base_27) 1) (not (= (mod v_~sorted1~0_24 256) 0)) (< (+ v_thread1Thread1of1ForFork1_~i~0_31 1) v_~N~0_29)))) InVars {~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} OutVars{~A~0.base=v_~A~0.base_27, ~A~0.offset=v_~A~0.offset_27, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~short4=|v_thread1Thread1of1ForFork1_#t~short4_25|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_52|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_31, #length=|v_#length_66|, ~N~0=v_~N~0_29, ~sorted1~0=v_~sorted1~0_24} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~short4] 23982#[thread2ENTRY, L85-4, L48-3]don't care [2022-07-22 12:50:41,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:41,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1075706, now seen corresponding path program 1 times [2022-07-22 12:50:41,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:41,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774550441] [2022-07-22 12:50:41,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:41,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:41,098 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:41,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:41,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:41,124 INFO L85 PathProgramCache]: Analyzing trace with hash 21722, now seen corresponding path program 5 times [2022-07-22 12:50:41,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:41,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162987574] [2022-07-22 12:50:41,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:41,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:41,131 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:41,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:41,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:50:41,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1033732705, now seen corresponding path program 1 times [2022-07-22 12:50:41,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:50:41,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387447318] [2022-07-22 12:50:41,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:50:41,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:50:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:41,176 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:50:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:50:41,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:50:43,852 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:50:43,852 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:50:43,853 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:50:43,853 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:50:43,853 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:50:43,853 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:50:43,853 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:50:43,853 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:50:43,853 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-more-sorted.wvr.c_BEv2_Iteration12_Lasso [2022-07-22 12:50:43,853 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:50:43,853 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:50:43,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:43,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:50:44,447 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:602) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:910) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:819) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:253) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:356) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.runCegarLoops(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:331) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 12:50:44,450 INFO L158 Benchmark]: Toolchain (without parser) took 41455.12ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 129.9MB in the beginning and 121.7MB in the end (delta: 8.2MB). Peak memory consumption was 148.9MB. Max. memory is 8.0GB. [2022-07-22 12:50:44,450 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:50:44,451 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.70ms. Allocated memory is still 155.2MB. Free memory was 129.7MB in the beginning and 118.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 12:50:44,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.37ms. Allocated memory is still 155.2MB. Free memory was 118.5MB in the beginning and 116.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:50:44,451 INFO L158 Benchmark]: Boogie Preprocessor took 40.20ms. Allocated memory is still 155.2MB. Free memory was 116.6MB in the beginning and 115.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 12:50:44,452 INFO L158 Benchmark]: RCFGBuilder took 857.57ms. Allocated memory is still 155.2MB. Free memory was 115.2MB in the beginning and 131.2MB in the end (delta: -16.0MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-07-22 12:50:44,452 INFO L158 Benchmark]: BuchiAutomizer took 40087.34ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 131.2MB in the beginning and 121.7MB in the end (delta: 9.5MB). Peak memory consumption was 150.5MB. Max. memory is 8.0GB. [2022-07-22 12:50:44,454 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 401.70ms. Allocated memory is still 155.2MB. Free memory was 129.7MB in the beginning and 118.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.37ms. Allocated memory is still 155.2MB. Free memory was 118.5MB in the beginning and 116.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.20ms. Allocated memory is still 155.2MB. Free memory was 116.6MB in the beginning and 115.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 857.57ms. Allocated memory is still 155.2MB. Free memory was 115.2MB in the beginning and 131.2MB in the end (delta: -16.0MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * BuchiAutomizer took 40087.34ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 131.2MB in the beginning and 121.7MB in the end (delta: 9.5MB). Peak memory consumption was 150.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 172 PlacesBefore, 32 PlacesAfterwards, 177 TransitionsBefore, 28 TransitionsAfterwards, 3534 CoEnabledTransitionPairs, 8 FixpointIterations, 90 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 25 ConcurrentYvCompositions, 9 ChoiceCompositions, 180 TotalNumberOfCompositions, 4228 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3797, positive: 3749, positive conditional: 0, positive unconditional: 3749, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2028, positive: 2013, positive conditional: 0, positive unconditional: 2013, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3797, positive: 1736, positive conditional: 0, positive unconditional: 1736, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 2028, unknown conditional: 0, unknown unconditional: 2028] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 12:50:44,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Forceful destruction successful, exit code 0 [2022-07-22 12:50:44,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Ended with exit code 0 [2022-07-22 12:50:44,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Ended with exit code 0 [2022-07-22 12:50:45,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-07-22 12:50:45,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-07-22 12:50:45,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...